Base | Representation |
---|---|
bin | 11101000111110000111… |
… | …100001011101111011011 |
3 | 21002022110012210220211011 |
4 | 131013300330023233123 |
5 | 230241430214214321 |
6 | 4131201202114351 |
7 | 264403440124225 |
oct | 35076074135733 |
9 | 7068405726734 |
10 | 2001202101211 |
11 | 701783462265 |
12 | 283a1a64b9b7 |
13 | 116935613071 |
14 | 6cc043a9415 |
15 | 370c87d0ae1 |
hex | 1d1f0f0bbdb |
2001202101211 has 8 divisors (see below), whose sum is σ = 2012760230400. Its totient is φ = 1989670513320.
The previous prime is 2001202101113. The next prime is 2001202101229. The reversal of 2001202101211 is 1121012021002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2001202101211 - 29 = 2001202100699 is a prime.
It is a super-3 number, since 3×20012021012113 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2001202101191 and 2001202101200.
It is not an unprimeable number, because it can be changed into a prime (2001202101251) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6484081 + ... + 6785698.
It is an arithmetic number, because the mean of its divisors is an integer number (251595028800).
Almost surely, 22001202101211 is an apocalyptic number.
2001202101211 is a deficient number, since it is larger than the sum of its proper divisors (11558129189).
2001202101211 is a wasteful number, since it uses less digits than its factorization.
2001202101211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13270649.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2001202101211 its reverse (1121012021002), we get a palindrome (3122214122213).
The spelling of 2001202101211 in words is "two trillion, one billion, two hundred two million, one hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •