Base | Representation |
---|---|
bin | 10000001011101110011… |
… | …100111010101001000000 |
3 | 10221022112022100011101102 |
4 | 100023232130322221000 |
5 | 121210041120320000 |
6 | 2210520451553532 |
7 | 143226633023144 |
oct | 20135634725100 |
9 | 3838468304342 |
10 | 1112102120000 |
11 | 399704721963 |
12 | 15b6488bb8a8 |
13 | 80b42146521 |
14 | 3bb7c8a9224 |
15 | 1dddd1943d5 |
hex | 102ee73aa40 |
1112102120000 has 140 divisors (see below), whose sum is σ = 2821787626416. Its totient is φ = 434495040000.
The previous prime is 1112102119981. The next prime is 1112102120033. The reversal of 1112102120000 is 212012111.
It is a super-2 number, since 2×11121021200002 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 1396715 + ... + 2043285.
Almost surely, 21112102120000 is an apocalyptic number.
1112102120000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1112102120000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1410893813208).
1112102120000 is an abundant number, since it is smaller than the sum of its proper divisors (1709685506416).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1112102120000 is an frugal number, since it uses more digits than its factorization.
1112102120000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 646646 (or 646621 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1112102120000 its reverse (212012111), we get a palindrome (1112314132111).
The spelling of 1112102120000 in words is "one trillion, one hundred twelve billion, one hundred two million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •