Base | Representation |
---|---|
bin | 11001000000111000110110… |
… | …101100101111111101110100 |
3 | 112102112001202001212002000220 |
4 | 121000320312230233331310 |
5 | 103404420001231121322 |
6 | 1025550524522534340 |
7 | 32113056056133243 |
oct | 3100706654577564 |
9 | 472461661762026 |
10 | 110012210020212 |
11 | 32064a095a9095 |
12 | 1040912a6673b0 |
13 | 4950150abb0a6 |
14 | 1d248957cc95a |
15 | caba0b61b55c |
hex | 640e36b2ff74 |
110012210020212 has 48 divisors (see below), whose sum is σ = 259486151908032. Its totient is φ = 36273060046080.
The previous prime is 110012210020133. The next prime is 110012210020267. The reversal of 110012210020212 is 212020012210011.
It is a junction number, because it is equal to n+sod(n) for n = 110012210020191 and 110012210020200.
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, 63961633 + ... + 65659080.
It is an arithmetic number, because the mean of its divisors is an integer number (5405961498084).
Almost surely, 2110012210020212 is an apocalyptic number.
110012210020212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
110012210020212 is an abundant number, since it is smaller than the sum of its proper divisors (149473941887820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110012210020212 is a wasteful number, since it uses less digits than its factorization.
110012210020212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 129621488 (or 129621486 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 110012210020212 its reverse (212020012210011), we get a palindrome (322032222230223).
The spelling of 110012210020212 in words is "one hundred ten trillion, twelve billion, two hundred ten million, twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.464 sec. • engine limits •