Base | Representation |
---|---|
bin | 101111100000011101… |
… | …1111111100011100101 |
3 | 100202100000212221112201 |
4 | 1133000323333203211 |
5 | 3132414411400401 |
6 | 114511244214501 |
7 | 10241115615112 |
oct | 1370073774345 |
9 | 322300787481 |
10 | 102021200101 |
11 | 3a2a3342707 |
12 | 1793283a431 |
13 | 980b49a532 |
14 | 4d1b677909 |
15 | 29c18d8b01 |
hex | 17c0eff8e5 |
102021200101 has 2 divisors, whose sum is σ = 102021200102. Its totient is φ = 102021200100.
The previous prime is 102021200063. The next prime is 102021200111. The reversal of 102021200101 is 101002120201.
It is an a-pointer prime, because the next prime (102021200111) can be obtained adding 102021200101 to its sum of digits (10).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 74460219876 + 27560980225 = 272874^2 + 166015^2 .
It is a cyclic number.
It is not a de Polignac number, because 102021200101 - 211 = 102021198053 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102021200111) 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, 51010600050 + 51010600051.
It is an arithmetic number, because the mean of its divisors is an integer number (51010600051).
Almost surely, 2102021200101 is an apocalyptic number.
It is an amenable number.
102021200101 is a deficient number, since it is larger than the sum of its proper divisors (1).
102021200101 is an equidigital number, since it uses as much as digits as its factorization.
102021200101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 102021200101 its reverse (101002120201), we get a palindrome (203023320302).
The spelling of 102021200101 in words is "one hundred two billion, twenty-one million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •