Base | Representation |
---|---|
bin | 11000001111001011… |
… | …00110101001011111 |
3 | 1020120211202020202111 |
4 | 30013211212221133 |
5 | 203122110400111 |
6 | 5551104334451 |
7 | 640311606145 |
oct | 140745465137 |
9 | 36524666674 |
10 | 13012200031 |
11 | 5578058526 |
12 | 2631914427 |
13 | 12c4a83a5c |
14 | 8b6223595 |
15 | 512561a21 |
hex | 307966a5f |
13012200031 has 2 divisors, whose sum is σ = 13012200032. Its totient is φ = 13012200030.
The previous prime is 13012200013. The next prime is 13012200107. The reversal of 13012200031 is 13000221031.
Together with previous prime (13012200013) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13012200031 - 25 = 13012199999 is a prime.
It is a super-2 number, since 2×130122000312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13012199984 and 13012200020.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13012200731) 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, 6506100015 + 6506100016.
It is an arithmetic number, because the mean of its divisors is an integer number (6506100016).
Almost surely, 213012200031 is an apocalyptic number.
13012200031 is a deficient number, since it is larger than the sum of its proper divisors (1).
13012200031 is an equidigital number, since it uses as much as digits as its factorization.
13012200031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 13012200031 its reverse (13000221031), we get a palindrome (26012421062).
The spelling of 13012200031 in words is "thirteen billion, twelve million, two hundred thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •