Base | Representation |
---|---|
bin | 10000000001011001010… |
… | …100010000111001110000 |
3 | 10220020220021202210001110 |
4 | 100001121110100321300 |
5 | 121014332042041422 |
6 | 2201444055433320 |
7 | 142355025352551 |
oct | 20013124207160 |
9 | 3806807683043 |
10 | 1101010112112 |
11 | 394a32561199 |
12 | 159472085840 |
13 | 7ca95146051 |
14 | 3b4096c8328 |
15 | 1d98e4cd60c |
hex | 10059510e70 |
1101010112112 has 80 divisors (see below), whose sum is σ = 2849735814560. Its totient is φ = 366299366400.
The previous prime is 1101010112071. The next prime is 1101010112129. The reversal of 1101010112112 is 2112110101011.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 100921314 + ... + 100932222.
It is an arithmetic number, because the mean of its divisors is an integer number (35621697682).
Almost surely, 21101010112112 is an apocalyptic number.
1101010112112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1101010112112 is an abundant number, since it is smaller than the sum of its proper divisors (1748725702448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101010112112 is a wasteful number, since it uses less digits than its factorization.
1101010112112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14762 (or 14756 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 1101010112112 its reverse (2112110101011), we get a palindrome (3213120213123).
It can be divided in two parts, 110101011 and 2112, that multiplied together give a palindrome (232533335232).
The spelling of 1101010112112 in words is "one trillion, one hundred one billion, ten million, one hundred twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •