Base | Representation |
---|---|
bin | 10001100110111111100… |
… | …101100010111111111000 |
3 | 11021200110221211102000102 |
4 | 101212333211202333320 |
5 | 124311241111213422 |
6 | 2323525020454532 |
7 | 153266260100660 |
oct | 21467745427770 |
9 | 4250427742012 |
10 | 1210100101112 |
11 | 427222a615a1 |
12 | 1766380aa448 |
13 | 8a15bc529b6 |
14 | 427d7aa71a0 |
15 | 2172676d192 |
hex | 119bf962ff8 |
1210100101112 has 64 divisors (see below), whose sum is σ = 2613273062400. Its totient is φ = 514575285120.
The previous prime is 1210100101081. The next prime is 1210100101139. The reversal of 1210100101112 is 2111010010121.
It is a super-2 number, since 2×12101001011122 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1210100101093 and 1210100101102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 92346353 + ... + 92359455.
It is an arithmetic number, because the mean of its divisors is an integer number (40832391600).
Almost surely, 21210100101112 is an apocalyptic number.
It is an amenable number.
1210100101112 is an abundant number, since it is smaller than the sum of its proper divisors (1403172961288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1210100101112 is a wasteful number, since it uses less digits than its factorization.
1210100101112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25836 (or 25832 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1210100101112 its reverse (2111010010121), we get a palindrome (3321110111233).
Subtracting 1210100101112 from its reverse (2111010010121), we obtain a palindrome (900909909009).
The spelling of 1210100101112 in words is "one trillion, two hundred ten billion, one hundred million, one hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •