Base | Representation |
---|---|
bin | 100101010101110100111… |
… | …0101101100110100110111 |
3 | 200011121212212010210110102 |
4 | 1022223221311230310313 |
5 | 1133041032203314431 |
6 | 14525354412344315 |
7 | 1036532400152465 |
oct | 112535165546467 |
9 | 20147785123412 |
10 | 5132114119991 |
11 | 16a95766992a1 |
12 | 6aa77a77509b |
13 | 2b2c57c5b871 |
14 | 13a577935835 |
15 | 8d770e8adcb |
hex | 4aae9d6cd37 |
5132114119991 has 2 divisors, whose sum is σ = 5132114119992. Its totient is φ = 5132114119990.
The previous prime is 5132114119907. The next prime is 5132114120017. The reversal of 5132114119991 is 1999114112315.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5132114119991 - 218 = 5132113857847 is a prime.
It is a super-2 number, since 2×51321141199912 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5132114199991) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2566057059995 + 2566057059996.
It is an arithmetic number, because the mean of its divisors is an integer number (2566057059996).
Almost surely, 25132114119991 is an apocalyptic number.
5132114119991 is a deficient number, since it is larger than the sum of its proper divisors (1).
5132114119991 is an equidigital number, since it uses as much as digits as its factorization.
5132114119991 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 87480, while the sum is 47.
The spelling of 5132114119991 in words is "five trillion, one hundred thirty-two billion, one hundred fourteen million, one hundred nineteen thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •