Base | Representation |
---|---|
bin | 11110110110011111110… |
… | …111100001111000111000 |
3 | 21111200100111002100111200 |
4 | 132312133313201320320 |
5 | 234213431324323000 |
6 | 4301543322254200 |
7 | 306113036153130 |
oct | 36663767417070 |
9 | 7450314070450 |
10 | 2120101011000 |
11 | 748147827a75 |
12 | 2a2a81657360 |
13 | 124c0365745b |
14 | 748833abac0 |
15 | 3a236c87500 |
hex | 1ed9fde1e38 |
2120101011000 has 192 divisors, whose sum is σ = 8189647577280. Its totient is φ = 484594502400.
The previous prime is 2120101010987. The next prime is 2120101011011. The reversal of 2120101011000 is 1101010212.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 16763199 + ... + 16889198.
It is an arithmetic number, because the mean of its divisors is an integer number (42654414465).
Almost surely, 22120101011000 is an apocalyptic number.
2120101011000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2120101011000 is an abundant number, since it is smaller than the sum of its proper divisors (6069546566280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2120101011000 is a wasteful number, since it uses less digits than its factorization.
2120101011000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33652431 (or 33652414 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 2120101011000 its reverse (1101010212), we get a palindrome (2121202021212).
The spelling of 2120101011000 in words is "two trillion, one hundred twenty billion, one hundred one million, eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •