Base | Representation |
---|---|
bin | 11110110110100010010… |
… | …110010011000100100000 |
3 | 21111200110101101212200120 |
4 | 132312202112103010200 |
5 | 234214023003144300 |
6 | 4301551410320240 |
7 | 306114053006616 |
oct | 36664226230440 |
9 | 7450411355616 |
10 | 2120142631200 |
11 | 748169274930 |
12 | 2a2a93589080 |
13 | 124c0c16a5a9 |
14 | 74888b236b6 |
15 | 3a23a7593a0 |
hex | 1eda2593120 |
2120142631200 has 1152 divisors, whose sum is σ = 8019134742528. Its totient is φ = 481536000000.
The previous prime is 2120142631183. The next prime is 2120142631261. The reversal of 2120142631200 is 21362410212.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 11100223105 + ... + 11100223295.
It is an arithmetic number, because the mean of its divisors is an integer number (6961054464).
Almost surely, 22120142631200 is an apocalyptic number.
2120142631200 is a gapful number since it is divisible by the number (20) 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 2120142631200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4009567371264).
2120142631200 is an abundant number, since it is smaller than the sum of its proper divisors (5898992111328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2120142631200 is a wasteful number, since it uses less digits than its factorization.
2120142631200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 530 (or 517 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
The spelling of 2120142631200 in words is "two trillion, one hundred twenty billion, one hundred forty-two million, six hundred thirty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •