Base | Representation |
---|---|
bin | 10110100010100011… |
… | …01110110110111000 |
3 | 1011020100012120021010 |
4 | 23101101232312320 |
5 | 144240330133422 |
6 | 5320434513520 |
7 | 605605660635 |
oct | 132121566670 |
9 | 34210176233 |
10 | 12101021112 |
11 | 514a7902a4 |
12 | 24187358a0 |
13 | 11ab07502b |
14 | 82b1d718c |
15 | 4ac577b0c |
hex | 2d146edb8 |
12101021112 has 32 divisors (see below), whose sum is σ = 31844793600. Its totient is φ = 3821374944.
The previous prime is 12101021111. The next prime is 12101021113. The reversal of 12101021112 is 21112010121.
It is an interprime number because it is at equal distance from previous prime (12101021111) and next prime (12101021113).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12101021111) 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, 13268208 + ... + 13269119.
It is an arithmetic number, because the mean of its divisors is an integer number (995149800).
Almost surely, 212101021112 is an apocalyptic number.
12101021112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12101021112 is an abundant number, since it is smaller than the sum of its proper divisors (19743772488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12101021112 is a wasteful number, since it uses less digits than its factorization.
12101021112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26537355 (or 26537351 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 12101021112 its reverse (21112010121), we get a palindrome (33213031233).
The spelling of 12101021112 in words is "twelve billion, one hundred one million, twenty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •