Base | Representation |
---|---|
bin | 10111000000101011101101… |
… | …011001000111010010100001 |
3 | 111021022211001112112112210012 |
4 | 113000223231121013102201 |
5 | 101231043200031241001 |
6 | 555123320305414305 |
7 | 30213413646312125 |
oct | 2700535531072241 |
9 | 437284045475705 |
10 | 101202002212001 |
11 | 2a278589a10829 |
12 | b42576193a395 |
13 | 44614004a0a82 |
14 | 1adc2bb20d585 |
15 | ba776a1582bb |
hex | 5c0aed6474a1 |
101202002212001 has 32 divisors (see below), whose sum is σ = 106822527410592. Its totient is φ = 95782492569600.
The previous prime is 101202002211953. The next prime is 101202002212037. The reversal of 101202002212001 is 100212200202101.
It can be written as a sum of positive squares in 16 ways, for example, as 11172647187601 + 90029355024400 = 3342551^2 + 9488380^2 .
It is a cyclic number.
It is not a de Polignac number, because 101202002212001 - 218 = 101202001949857 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (101202002212081) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 48642065 + ... + 50679921.
It is an arithmetic number, because the mean of its divisors is an integer number (3338203981581).
Almost surely, 2101202002212001 is an apocalyptic number.
It is an amenable number.
101202002212001 is a deficient number, since it is larger than the sum of its proper divisors (5620525198591).
101202002212001 is a wasteful number, since it uses less digits than its factorization.
101202002212001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2038229.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 101202002212001 its reverse (100212200202101), we get a palindrome (201414202414102).
The spelling of 101202002212001 in words is "one hundred one trillion, two hundred two billion, two million, two hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •