Base | Representation |
---|---|
bin | 1001010010011011110010… |
… | …1001101010101100110011 |
3 | 1100011021201220110122001201 |
4 | 2110212330221222230303 |
5 | 2314304243342131003 |
6 | 33415244504112031 |
7 | 2102546241213064 |
oct | 224467451525463 |
9 | 40137656418051 |
10 | 10212302302003 |
11 | 328801646285a |
12 | 118b267465617 |
13 | 591029134a29 |
14 | 2743c704056b |
15 | 12a9a344db1d |
hex | 949bca6ab33 |
10212302302003 has 2 divisors, whose sum is σ = 10212302302004. Its totient is φ = 10212302302002.
The previous prime is 10212302301997. The next prime is 10212302302019. The reversal of 10212302302003 is 30020320321201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10212302302003 - 233 = 10203712367411 is a prime.
It is a super-2 number, since 2×102123023020032 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10212302302303) 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, 5106151151001 + 5106151151002.
It is an arithmetic number, because the mean of its divisors is an integer number (5106151151002).
Almost surely, 210212302302003 is an apocalyptic number.
10212302302003 is a deficient number, since it is larger than the sum of its proper divisors (1).
10212302302003 is an equidigital number, since it uses as much as digits as its factorization.
10212302302003 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 10212302302003 its reverse (30020320321201), we get a palindrome (40232622623204).
It can be divided in two parts, 1021230 and 2302003, that added together give a palindrome (3323233).
The spelling of 10212302302003 in words is "ten trillion, two hundred twelve billion, three hundred two million, three hundred two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •