Base | Representation |
---|---|
bin | 100110100100100001110… |
… | …0011110110010000101111 |
3 | 200202210010101101020222021 |
4 | 1031021003203312100233 |
5 | 1143323200004122111 |
6 | 15135145145531011 |
7 | 1054664525666443 |
oct | 115110343662057 |
9 | 20683111336867 |
10 | 5301123114031 |
11 | 1764214885a78 |
12 | 7174874a3a67 |
13 | 2c5b807a7494 |
14 | 14480bb22823 |
15 | 92d637ced71 |
hex | 4d2438f642f |
5301123114031 has 2 divisors, whose sum is σ = 5301123114032. Its totient is φ = 5301123114030.
The previous prime is 5301123114017. The next prime is 5301123114101. The reversal of 5301123114031 is 1304113211035.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5301123114031 - 25 = 5301123113999 is a prime.
It is a super-2 number, since 2×53011231140312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5301123113987 and 5301123114005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5301124114031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2650561557015 + 2650561557016.
It is an arithmetic number, because the mean of its divisors is an integer number (2650561557016).
Almost surely, 25301123114031 is an apocalyptic number.
5301123114031 is a deficient number, since it is larger than the sum of its proper divisors (1).
5301123114031 is an equidigital number, since it uses as much as digits as its factorization.
5301123114031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 25.
Adding to 5301123114031 its reverse (1304113211035), we get a palindrome (6605236325066).
The spelling of 5301123114031 in words is "five trillion, three hundred one billion, one hundred twenty-three million, one hundred fourteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •