Base | Representation |
---|---|
bin | 100101001010100110010… |
… | …0110000100010011100101 |
3 | 200002022122101100122011121 |
4 | 1022111030212010103211 |
5 | 1132142141244144334 |
6 | 14510330000133541 |
7 | 1035020013332002 |
oct | 112251446042345 |
9 | 20068571318147 |
10 | 5108001162469 |
11 | 169a322544427 |
12 | 6a5b6b3072b1 |
13 | 2b08b4432c6a |
14 | 13932b2d48a9 |
15 | 8cd0e0d5db4 |
hex | 4a54c9844e5 |
5108001162469 has 2 divisors, whose sum is σ = 5108001162470. Its totient is φ = 5108001162468.
The previous prime is 5108001162437. The next prime is 5108001162479. The reversal of 5108001162469 is 9642611008015.
5108001162469 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5025048522244 + 82952640225 = 2241662^2 + 288015^2 .
It is a cyclic number.
It is not a de Polignac number, because 5108001162469 - 25 = 5108001162437 is a prime.
It is a super-2 number, since 2×51080011624692 (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 (5108001162479) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2554000581234 + 2554000581235.
It is an arithmetic number, because the mean of its divisors is an integer number (2554000581235).
Almost surely, 25108001162469 is an apocalyptic number.
It is an amenable number.
5108001162469 is a deficient number, since it is larger than the sum of its proper divisors (1).
5108001162469 is an equidigital number, since it uses as much as digits as its factorization.
5108001162469 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 103680, while the sum is 43.
The spelling of 5108001162469 in words is "five trillion, one hundred eight billion, one million, one hundred sixty-two thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •