Base | Representation |
---|---|
bin | 1010111011001000110101… |
… | …0110110010001111000000 |
3 | 1120112020202012220121212000 |
4 | 2232302031112302033000 |
5 | 3033242213112320000 |
6 | 41313453452104000 |
7 | 2346526154330262 |
oct | 256621526621700 |
9 | 46466665817760 |
10 | 12011100120000 |
11 | 39109739862a3 |
12 | 141b9b9165000 |
13 | 6918462a0527 |
14 | 2d74a9cb1b32 |
15 | 15c68268a000 |
hex | aec8d5b23c0 |
12011100120000 has 280 divisors, whose sum is σ = 44123892397200. Its totient is φ = 3202959744000.
The previous prime is 12011100119927. The next prime is 12011100120007. The reversal of 12011100120000 is 2100111021.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12011100120007) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 4480695 + ... + 6640694.
It is an arithmetic number, because the mean of its divisors is an integer number (157585329990).
Almost surely, 212011100120000 is an apocalyptic number.
12011100120000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12011100120000 is an abundant number, since it is smaller than the sum of its proper divisors (32112792277200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12011100120000 is an equidigital number, since it uses as much as digits as its factorization.
12011100120000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11121430 (or 11121399 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 12011100120000 its reverse (2100111021), we get a palindrome (12013200231021).
The spelling of 12011100120000 in words is "twelve trillion, eleven billion, one hundred million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •