Base | Representation |
---|---|
bin | 1001011000111000001101… |
… | …1101101010010011011101 |
3 | 1100112212111110022011020021 |
4 | 2112032003131222103131 |
5 | 2323113012033044122 |
6 | 33542154245152141 |
7 | 2113545601150546 |
oct | 226160335522335 |
9 | 40485443264207 |
10 | 10323012003037 |
11 | 331aa68178848 |
12 | 11a88039bb651 |
13 | 59b5c0689776 |
14 | 2798ca5a54cd |
15 | 12d7d29d31c7 |
hex | 9638376a4dd |
10323012003037 has 2 divisors, whose sum is σ = 10323012003038. Its totient is φ = 10323012003036.
The previous prime is 10323012002977. The next prime is 10323012003041. The reversal of 10323012003037 is 73030021032301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8524875828121 + 1798136174916 = 2919739^2 + 1340946^2 .
It is a cyclic number.
It is not a de Polignac number, because 10323012003037 - 27 = 10323012002909 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10323012003637) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5161506001518 + 5161506001519.
It is an arithmetic number, because the mean of its divisors is an integer number (5161506001519).
Almost surely, 210323012003037 is an apocalyptic number.
It is an amenable number.
10323012003037 is a deficient number, since it is larger than the sum of its proper divisors (1).
10323012003037 is an equidigital number, since it uses as much as digits as its factorization.
10323012003037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268, while the sum is 25.
Adding to 10323012003037 its reverse (73030021032301), we get a palindrome (83353033035338).
The spelling of 10323012003037 in words is "ten trillion, three hundred twenty-three billion, twelve million, three thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •