Base | Representation |
---|---|
bin | 100101010100110101010… |
… | …0001110010001001010011 |
3 | 200011102101000000102201121 |
4 | 1022221222201302021103 |
5 | 1133022143404124332 |
6 | 14524402432143111 |
7 | 1036425433111522 |
oct | 112515241621123 |
9 | 20142330012647 |
10 | 5129978192467 |
11 | 16a867aa51337 |
12 | 6aa283397a97 |
13 | 2b29a75a1a1b |
14 | 13a413db64b9 |
15 | 8d6986c8797 |
hex | 4aa6a872253 |
5129978192467 has 2 divisors, whose sum is σ = 5129978192468. Its totient is φ = 5129978192466.
The previous prime is 5129978192453. The next prime is 5129978192473. The reversal of 5129978192467 is 7642918799215.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5129978192467 is a prime.
It is a super-3 number, since 3×51299781924673 (a number of 39 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5129978192396 and 5129978192405.
It is not a weakly prime, because it can be changed into another prime (5129978192267) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2564989096233 + 2564989096234.
It is an arithmetic number, because the mean of its divisors is an integer number (2564989096234).
Almost surely, 25129978192467 is an apocalyptic number.
5129978192467 is a deficient number, since it is larger than the sum of its proper divisors (1).
5129978192467 is an equidigital number, since it uses as much as digits as its factorization.
5129978192467 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 137168640, while the sum is 70.
The spelling of 5129978192467 in words is "five trillion, one hundred twenty-nine billion, nine hundred seventy-eight million, one hundred ninety-two thousand, four hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •