Base | Representation |
---|---|
bin | 10000001011110000001… |
… | …011111001001011101100 |
3 | 10221022121100002012010100 |
4 | 100023300023321023230 |
5 | 121210121042241022 |
6 | 2210523411311100 |
7 | 143230435220412 |
oct | 20136013711354 |
9 | 3838540065110 |
10 | 1112131212012 |
11 | 39971a092147 |
12 | 15b6565ab490 |
13 | 80b48191132 |
14 | 3bb826bd2b2 |
15 | 1dde09de1ac |
hex | 102f02f92ec |
1112131212012 has 72 divisors (see below), whose sum is σ = 2823783282320. Its totient is φ = 369054766080.
The previous prime is 1112131211987. The next prime is 1112131212013. The reversal of 1112131212012 is 2102121312111.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (1112131212013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 29766039 + ... + 29803377.
Almost surely, 21112131212012 is an apocalyptic number.
1112131212012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1112131212012 is an abundant number, since it is smaller than the sum of its proper divisors (1711652070308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1112131212012 is a wasteful number, since it uses less digits than its factorization.
1112131212012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41023 (or 41018 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 1112131212012 its reverse (2102121312111), we get a palindrome (3214252524123).
The spelling of 1112131212012 in words is "one trillion, one hundred twelve billion, one hundred thirty-one million, two hundred twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •