Base | Representation |
---|---|
bin | 101000000101010011101… |
… | …1111001010100111000101 |
3 | 201111122120202110100021021 |
4 | 1100022213133022213011 |
5 | 1210224321224212334 |
6 | 15414440321351141 |
7 | 1106003054464654 |
oct | 120124737124705 |
9 | 21448522410237 |
10 | 5508958038469 |
11 | 1834377215936 |
12 | 74b80aa984b1 |
13 | 30c65308ca02 |
14 | 1508c65bb19b |
15 | 984799e33b4 |
hex | 502a77ca9c5 |
5508958038469 has 2 divisors, whose sum is σ = 5508958038470. Its totient is φ = 5508958038468.
The previous prime is 5508958038401. The next prime is 5508958038533. The reversal of 5508958038469 is 9648308598055.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3515298757569 + 1993659280900 = 1874913^2 + 1411970^2 .
It is a cyclic number.
It is not a de Polignac number, because 5508958038469 - 231 = 5506810554821 is a prime.
It is a super-2 number, since 2×55089580384692 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5508958038398 and 5508958038407.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5508958038869) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2754479019234 + 2754479019235.
It is an arithmetic number, because the mean of its divisors is an integer number (2754479019235).
Almost surely, 25508958038469 is an apocalyptic number.
It is an amenable number.
5508958038469 is a deficient number, since it is larger than the sum of its proper divisors (1).
5508958038469 is an equidigital number, since it uses as much as digits as its factorization.
5508958038469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 373248000, while the sum is 70.
The spelling of 5508958038469 in words is "five trillion, five hundred eight billion, nine hundred fifty-eight million, thirty-eight thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •