Base | Representation |
---|---|
bin | 1001000110001001011010… |
… | …0101010001111001000101 |
3 | 1022102002212112110210201002 |
4 | 2101202112211101321011 |
5 | 2302324434304020401 |
6 | 33134254220143045 |
7 | 2051364212136632 |
oct | 221422645217105 |
9 | 38362775423632 |
10 | 10001210220101 |
11 | 3206542490321 |
12 | 1156375097a85 |
13 | 577157aba7a9 |
14 | 2680bdb5d189 |
15 | 12524b2eba6b |
hex | 91896951e45 |
10001210220101 has 2 divisors, whose sum is σ = 10001210220102. Its totient is φ = 10001210220100.
The previous prime is 10001210220037. The next prime is 10001210220121. The reversal of 10001210220101 is 10102201210001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7892020407076 + 2109189813025 = 2809274^2 + 1452305^2 .
It is a cyclic number.
It is not a de Polignac number, because 10001210220101 - 26 = 10001210220037 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10001210220121) 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, 5000605110050 + 5000605110051.
It is an arithmetic number, because the mean of its divisors is an integer number (5000605110051).
Almost surely, 210001210220101 is an apocalyptic number.
It is an amenable number.
10001210220101 is a deficient number, since it is larger than the sum of its proper divisors (1).
10001210220101 is an equidigital number, since it uses as much as digits as its factorization.
10001210220101 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 11.
Adding to 10001210220101 its reverse (10102201210001), we get a palindrome (20103411430102).
The spelling of 10001210220101 in words is "ten trillion, one billion, two hundred ten million, two hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •