Base | Representation |
---|---|
bin | 10000010101001000010… |
… | …101010100010101010000 |
3 | 10222021121001022020020120 |
4 | 100111020111110111100 |
5 | 121341231200341422 |
6 | 2215310452510240 |
7 | 144035106500634 |
oct | 20251025242520 |
9 | 3867531266216 |
10 | 1122200012112 |
11 | 3a2a16718743 |
12 | 1615a661b380 |
13 | 81a911b9c0a |
14 | 3c459a30dc4 |
15 | 1e2ce93c45c |
hex | 10548554550 |
1122200012112 has 40 divisors (see below), whose sum is σ = 2899413592320. Its totient is φ = 374015458560.
The previous prime is 1122200012111. The next prime is 1122200012161. The reversal of 1122200012112 is 2112100022211.
It is a junction number, because it is equal to n+sod(n) for n = 1122200012091 and 1122200012100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1122200012111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1245312 + ... + 1948127.
It is an arithmetic number, because the mean of its divisors is an integer number (72485339808).
Almost surely, 21122200012112 is an apocalyptic number.
1122200012112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1122200012112 is an abundant number, since it is smaller than the sum of its proper divisors (1777213580208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1122200012112 is a wasteful number, since it uses less digits than its factorization.
1122200012112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3200771 (or 3200765 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1122200012112 its reverse (2112100022211), we get a palindrome (3234300034323).
The spelling of 1122200012112 in words is "one trillion, one hundred twenty-two billion, two hundred million, twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •