Base | Representation |
---|---|
bin | 100100011000010101000… |
… | …1101011110111010010101 |
3 | 122201000000002101222112212 |
4 | 1020300222031132322111 |
5 | 1123410100312010401 |
6 | 14344554042323205 |
7 | 1024145621455544 |
oct | 110605215367225 |
9 | 18630002358485 |
10 | 5000050110101 |
11 | 1658566a32a72 |
12 | 6890627b9505 |
13 | 2a366c58a807 |
14 | 13400a2ac15b |
15 | 8a0e1d1ddbb |
hex | 48c2a35ee95 |
5000050110101 has 4 divisors (see below), whose sum is σ = 5000064283392. Its totient is φ = 5000035936812.
The previous prime is 5000050110091. The next prime is 5000050110103. The reversal of 5000050110101 is 1010110500005.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5000050110101 - 26 = 5000050110037 is a prime.
It is a super-2 number, since 2×50000501101012 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5000050110103) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6543605 + ... + 7267658.
It is an arithmetic number, because the mean of its divisors is an integer number (1250016070848).
Almost surely, 25000050110101 is an apocalyptic number.
It is an amenable number.
5000050110101 is a deficient number, since it is larger than the sum of its proper divisors (14173291).
5000050110101 is a wasteful number, since it uses less digits than its factorization.
5000050110101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14173290.
The product of its (nonzero) digits is 25, while the sum is 14.
Adding to 5000050110101 its reverse (1010110500005), we get a palindrome (6010160610106).
The spelling of 5000050110101 in words is "five trillion, fifty million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •