Base | Representation |
---|---|
bin | 10111000000111100101010… |
… | …001011110101010110010001 |
3 | 111021101120000220200002010210 |
4 | 113000330222023311112101 |
5 | 101231342433203310001 |
6 | 555135530250314333 |
7 | 30214626652120524 |
oct | 2700745213652621 |
9 | 437346026602123 |
10 | 101220202010001 |
11 | 2a2852792583a8 |
12 | b4291a0a289a9 |
13 | 4463040c17709 |
14 | 1add1263a8bbb |
15 | ba7e82d2add6 |
hex | 5c0f2a2f5591 |
101220202010001 has 8 divisors (see below), whose sum is σ = 134960749299424. Its totient is φ = 67479894696960.
The previous prime is 101220202009999. The next prime is 101220202010009. The reversal of 101220202010001 is 100010202022101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101220202010001 - 21 = 101220202009999 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 (101220202010009) 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 in 7 ways as a sum of consecutive naturals, for example, 59007595 + ... + 60698736.
It is an arithmetic number, because the mean of its divisors is an integer number (16870093662428).
Almost surely, 2101220202010001 is an apocalyptic number.
It is an amenable number.
101220202010001 is a deficient number, since it is larger than the sum of its proper divisors (33740547289423).
101220202010001 is a wasteful number, since it uses less digits than its factorization.
101220202010001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119988191.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 101220202010001 its reverse (100010202022101), we get a palindrome (201230404032102).
The spelling of 101220202010001 in words is "one hundred one trillion, two hundred twenty billion, two hundred two million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •