Base | Representation |
---|---|
bin | 10110111101110000100110… |
… | …110011101101011000111001 |
3 | 111020121121111110101111000211 |
4 | 112331300212303231120321 |
5 | 101214300224104202301 |
6 | 554451133221231121 |
7 | 30163042315006063 |
oct | 2675604663553071 |
9 | 436547443344024 |
10 | 101001102022201 |
11 | 2a200365aa8717 |
12 | b3b28348624a1 |
13 | 444849481ca14 |
14 | 1ad269d762733 |
15 | ba240cb6b051 |
hex | 5bdc26ced639 |
101001102022201 has 2 divisors, whose sum is σ = 101001102022202. Its totient is φ = 101001102022200.
The previous prime is 101001102022189. The next prime is 101001102022229. The reversal of 101001102022201 is 102220201100101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 94576403001600 + 6424699020601 = 9725040^2 + 2534699^2 .
It is a cyclic number.
It is not a de Polignac number, because 101001102022201 - 213 = 101001102014009 is a prime.
It is a super-3 number, since 3×1010011020222013 (a number of 43 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (101001102022501) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50500551011100 + 50500551011101.
It is an arithmetic number, because the mean of its divisors is an integer number (50500551011101).
Almost surely, 2101001102022201 is an apocalyptic number.
It is an amenable number.
101001102022201 is a deficient number, since it is larger than the sum of its proper divisors (1).
101001102022201 is an equidigital number, since it uses as much as digits as its factorization.
101001102022201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 101001102022201 its reverse (102220201100101), we get a palindrome (203221303122302).
The spelling of 101001102022201 in words is "one hundred one trillion, one billion, one hundred two million, twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •