Base | Representation |
---|---|
bin | 1001001100000000111001… |
… | …0000001110000110110101 |
3 | 1022202202000220101120101021 |
4 | 2103000032100032012311 |
5 | 2311002400031311201 |
6 | 33252443514301141 |
7 | 2061563014013335 |
oct | 223001620160665 |
9 | 38682026346337 |
10 | 10102002213301 |
11 | 3245264988659 |
12 | 1171a041277b1 |
13 | 5837cb70885b |
14 | 26cd220630c5 |
15 | 127b99d2aea1 |
hex | 9300e40e1b5 |
10102002213301 has 2 divisors, whose sum is σ = 10102002213302. Its totient is φ = 10102002213300.
The previous prime is 10102002213283. The next prime is 10102002213311. The reversal of 10102002213301 is 10331220020101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9704932095076 + 397070118225 = 3115274^2 + 630135^2 .
It is a cyclic number.
It is not a de Polignac number, because 10102002213301 - 213 = 10102002205109 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10102002213311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5051001106650 + 5051001106651.
It is an arithmetic number, because the mean of its divisors is an integer number (5051001106651).
Almost surely, 210102002213301 is an apocalyptic number.
It is an amenable number.
10102002213301 is a deficient number, since it is larger than the sum of its proper divisors (1).
10102002213301 is an equidigital number, since it uses as much as digits as its factorization.
10102002213301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 10102002213301 its reverse (10331220020101), we get a palindrome (20433222233402).
The spelling of 10102002213301 in words is "ten trillion, one hundred two billion, two million, two hundred thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.377 sec. • engine limits •