Base | Representation |
---|---|
bin | 1001010010010111011000… |
… | …1011100101101101001110 |
3 | 1100011011200111210002020011 |
4 | 2110211312023211231032 |
5 | 2314244333210341420 |
6 | 33414531311343434 |
7 | 2102505034005553 |
oct | 224456613455516 |
9 | 40134614702204 |
10 | 10211120012110 |
11 | 328756a052976 |
12 | 118ab97521b7a |
13 | 590b9b201604 |
14 | 274314000a2a |
15 | 12a93476095a |
hex | 949762e5b4e |
10211120012110 has 8 divisors (see below), whose sum is σ = 18380016021816. Its totient is φ = 4084448004840.
The previous prime is 10211120012101. The next prime is 10211120012113. The reversal of 10211120012110 is 1121002111201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10211120012113) 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 3 ways as a sum of consecutive naturals, for example, 510556000596 + ... + 510556000615.
It is an arithmetic number, because the mean of its divisors is an integer number (2297502002727).
Almost surely, 210211120012110 is an apocalyptic number.
10211120012110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10211120012110 is a deficient number, since it is larger than the sum of its proper divisors (8168896009706).
10211120012110 is a wasteful number, since it uses less digits than its factorization.
10211120012110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1021112001218.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10211120012110 its reverse (1121002111201), we get a palindrome (11332122123311).
The spelling of 10211120012110 in words is "ten trillion, two hundred eleven billion, one hundred twenty million, twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •