Base | Representation |
---|---|
bin | 11101010000111111000… |
… | …001010101111101000001 |
3 | 21010021000011020110021010 |
4 | 131100333001111331001 |
5 | 230422214103324301 |
6 | 4135515411351133 |
7 | 265203661020453 |
oct | 35207701257501 |
9 | 7107004213233 |
10 | 2011102011201 |
11 | 7059a3724158 |
12 | 285921bb24a9 |
13 | 117852657a7a |
14 | 6d4a31162d3 |
15 | 374a79bc5d6 |
hex | 1d43f055f41 |
2011102011201 has 8 divisors (see below), whose sum is σ = 2708018550144. Its totient is φ = 1327460073200.
The previous prime is 2011102011199. The next prime is 2011102011209. The reversal of 2011102011201 is 1021102011102.
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 2011102011201 - 21 = 2011102011199 is a prime.
It is a super-3 number, since 3×20111020112013 (a number of 38 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (2011102011209) 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, 3318649881 + ... + 3318650486.
It is an arithmetic number, because the mean of its divisors is an integer number (338502318768).
Almost surely, 22011102011201 is an apocalyptic number.
It is an amenable number.
2011102011201 is a deficient number, since it is larger than the sum of its proper divisors (696916538943).
2011102011201 is a wasteful number, since it uses less digits than its factorization.
2011102011201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6637300471.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 2011102011201 its reverse (1021102011102), we get a palindrome (3032204022303).
Subtracting from 2011102011201 its reverse (1021102011102), we obtain a palindrome (990000000099).
The spelling of 2011102011201 in words is "two trillion, eleven billion, one hundred two million, eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •