Base | Representation |
---|---|
bin | 11101010001000101011… |
… | …101101101010010010110 |
3 | 21010021021200122110002010 |
4 | 131101011131231102112 |
5 | 230422424242010402 |
6 | 4135534232325050 |
7 | 265206442603554 |
oct | 35210535552226 |
9 | 7107250573063 |
10 | 2011210110102 |
11 | 705a49747496 |
12 | 285952243786 |
13 | 11786bb75a0b |
14 | 6d4b3614bd4 |
15 | 374b2221a6c |
hex | 1d44576d496 |
2011210110102 has 8 divisors (see below), whose sum is σ = 4022420220216. Its totient is φ = 670403370032.
The previous prime is 2011210110023. The next prime is 2011210110103. The reversal of 2011210110102 is 2010110121102.
It is a sphenic number, since it is the product of 3 distinct primes.
2011210110102 is an admirable number.
It is a super-2 number, since 2×20112101101022 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011210110103) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 167600842503 + ... + 167600842514.
It is an arithmetic number, because the mean of its divisors is an integer number (502802527527).
Almost surely, 22011210110102 is an apocalyptic number.
2011210110102 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2011210110102 is a wasteful number, since it uses less digits than its factorization.
2011210110102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 335201685022.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 2011210110102 its reverse (2010110121102), we get a palindrome (4021320231204).
The spelling of 2011210110102 in words is "two trillion, eleven billion, two hundred ten million, one hundred ten thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •