Base | Representation |
---|---|
bin | 1011000001000000110000… |
… | …0011100000100011111000 |
3 | 1120212220012210200201202220 |
4 | 2300100030003200203320 |
5 | 3041420344031133422 |
6 | 41432103001324040 |
7 | 2360030620332561 |
oct | 260201403404370 |
9 | 46786183621686 |
10 | 12112010021112 |
11 | 394a746996591 |
12 | 143747b796620 |
13 | 69b2084621a1 |
14 | 2dc31db09168 |
15 | 1600db709e5c |
hex | b040c0e08f8 |
12112010021112 has 32 divisors (see below), whose sum is σ = 30438559226880. Its totient is φ = 4016198783840.
The previous prime is 12112010021107. The next prime is 12112010021123. The reversal of 12112010021112 is 21112001021121.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 12112010021091 and 12112010021100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1321113438 + ... + 1321122605.
It is an arithmetic number, because the mean of its divisors is an integer number (951204975840).
Almost surely, 212112010021112 is an apocalyptic number.
12112010021112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12112010021112 is an abundant number, since it is smaller than the sum of its proper divisors (18326549205768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12112010021112 is a wasteful number, since it uses less digits than its factorization.
12112010021112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2642236243 (or 2642236239 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 12112010021112 its reverse (21112001021121), we get a palindrome (33224011042233).
The spelling of 12112010021112 in words is "twelve trillion, one hundred twelve billion, ten million, twenty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •