Base | Representation |
---|---|
bin | 11110100100110100110… |
… | …000111001001110101100 |
3 | 21102212100221221111222102 |
4 | 132210310300321032230 |
5 | 233411100301142200 |
6 | 4245124304234232 |
7 | 304541550236051 |
oct | 36446460711654 |
9 | 7385327844872 |
10 | 2101124240300 |
11 | 7400999482a8 |
12 | 29b26630b978 |
13 | 12319ac60c57 |
14 | 739a2d5d028 |
15 | 399c5c8a6d5 |
hex | 1e934c393ac |
2101124240300 has 144 divisors (see below), whose sum is σ = 4768818109440. Its totient is φ = 802625760000.
The previous prime is 2101124240291. The next prime is 2101124240311. The reversal of 2101124240300 is 30424211012.
It is a Harshad number since it is a multiple of its sum of digits (20).
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, 96110771 + ... + 96132629.
Almost surely, 22101124240300 is an apocalyptic number.
2101124240300 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 2101124240300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2384409054720).
2101124240300 is an abundant number, since it is smaller than the sum of its proper divisors (2667693869140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2101124240300 is a wasteful number, since it uses less digits than its factorization.
2101124240300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22312 (or 22305 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 2101124240300 its reverse (30424211012), we get a palindrome (2131548451312).
The spelling of 2101124240300 in words is "two trillion, one hundred one billion, one hundred twenty-four million, two hundred forty thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •