Base | Representation |
---|---|
bin | 100101001001011001011… |
… | …1100111001010010000111 |
3 | 200002001222201221112210012 |
4 | 1022102302330321102013 |
5 | 1132121401401032432 |
6 | 14505222115020435 |
7 | 1034566103226644 |
oct | 112226274712207 |
9 | 20061881845705 |
10 | 5105423455367 |
11 | 169921a495984 |
12 | 6a556bb9a71b |
13 | 2b0593396ca1 |
14 | 139164c16dcb |
15 | 8cc0cb5acb2 |
hex | 4a4b2f39487 |
5105423455367 has 2 divisors, whose sum is σ = 5105423455368. Its totient is φ = 5105423455366.
The previous prime is 5105423455309. The next prime is 5105423455387. The reversal of 5105423455367 is 7635543245015.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5105423455367 - 230 = 5104349713543 is a prime.
It is a super-2 number, since 2×51054234553672 (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 (5105423455387) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2552711727683 + 2552711727684.
It is an arithmetic number, because the mean of its divisors is an integer number (2552711727684).
Almost surely, 25105423455367 is an apocalyptic number.
5105423455367 is a deficient number, since it is larger than the sum of its proper divisors (1).
5105423455367 is an equidigital number, since it uses as much as digits as its factorization.
5105423455367 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7560000, while the sum is 50.
The spelling of 5105423455367 in words is "five trillion, one hundred five billion, four hundred twenty-three million, four hundred fifty-five thousand, three hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •