Base | Representation |
---|---|
bin | 11011010010011001001001… |
… | …100011000101101101000000 |
3 | 120201220221220120121010122002 |
4 | 123102121021203011231000 |
5 | 111212230424242320000 |
6 | 1103124215552403132 |
7 | 34164344443503563 |
oct | 3322311143055500 |
9 | 521827816533562 |
10 | 120011210120000 |
11 | 3526a5174772a1 |
12 | 11562b875464a8 |
13 | 51c7015a42984 |
14 | 218c805bd84da |
15 | dd1b7889c8d5 |
hex | 6d26498c5b40 |
120011210120000 has 280 divisors, whose sum is σ = 314841866977440. Its totient is φ = 45247023360000.
The previous prime is 120011210119919. The next prime is 120011210120017. The reversal of 120011210120000 is 21012110021.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 149319215 + ... + 150120785.
Almost surely, 2120011210120000 is an apocalyptic number.
120011210120000 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 120011210120000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (157420933488720).
120011210120000 is an abundant number, since it is smaller than the sum of its proper divisors (194830656857440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120011210120000 is an equidigital number, since it uses as much as digits as its factorization.
120011210120000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 801819 (or 801794 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 120011210120000 its reverse (21012110021), we get a palindrome (120032222230021).
The spelling of 120011210120000 in words is "one hundred twenty trillion, eleven billion, two hundred ten million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •