Base | Representation |
---|---|
bin | 1011000000111101000010… |
… | …0000100101111000000100 |
3 | 1120212210122011212211001010 |
4 | 2300033100200211320010 |
5 | 3041411322304341400 |
6 | 41431415513202220 |
7 | 2356664100030060 |
oct | 260172040457004 |
9 | 46783564784033 |
10 | 12111011012100 |
11 | 394a283a8a300 |
12 | 1437241100370 |
13 | 69b0a94b10b0 |
14 | 2dc267178aa0 |
15 | 16007db72450 |
hex | b03d0825e04 |
12111011012100 has 864 divisors, whose sum is σ = 47489339376640. Its totient is φ = 2318846745600.
The previous prime is 12111011012059. The next prime is 12111011012129. The reversal of 12111011012100 is 121011011121.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 287 ways as a sum of consecutive naturals, for example, 2044739739 + ... + 2044745661.
Almost surely, 212111011012100 is an apocalyptic number.
12111011012100 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 12111011012100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23744669688320).
12111011012100 is an abundant number, since it is smaller than the sum of its proper divisors (35378328364540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12111011012100 is a wasteful number, since it uses less digits than its factorization.
12111011012100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6601 (or 6583 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 12111011012100 its reverse (121011011121), we get a palindrome (12232022023221).
The spelling of 12111011012100 in words is "twelve trillion, one hundred eleven billion, eleven million, twelve thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •