Base | Representation |
---|---|
bin | 100100110000000110110… |
… | …1011100000111100000001 |
3 | 122212212210121120112111102 |
4 | 1021200031223200330001 |
5 | 1130224133412113014 |
6 | 14424240503424145 |
7 | 1030634145345512 |
oct | 111401553407401 |
9 | 18785717515442 |
10 | 5051111051009 |
11 | 1678189562691 |
12 | 696b32a55055 |
13 | 2a8419083a0a |
14 | 136691890a09 |
15 | 8b5ce8d18de |
hex | 4980dae0f01 |
5051111051009 has 2 divisors, whose sum is σ = 5051111051010. Its totient is φ = 5051111051008.
The previous prime is 5051111050961. The next prime is 5051111051069. The reversal of 5051111051009 is 9001501111505.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3961978782784 + 1089132268225 = 1990472^2 + 1043615^2 .
It is a cyclic number.
It is not a de Polignac number, because 5051111051009 - 232 = 5046816083713 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (5051111051069) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2525555525504 + 2525555525505.
It is an arithmetic number, because the mean of its divisors is an integer number (2525555525505).
Almost surely, 25051111051009 is an apocalyptic number.
It is an amenable number.
5051111051009 is a deficient number, since it is larger than the sum of its proper divisors (1).
5051111051009 is an equidigital number, since it uses as much as digits as its factorization.
5051111051009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1125, while the sum is 29.
The spelling of 5051111051009 in words is "five trillion, fifty-one billion, one hundred eleven million, fifty-one thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •