Base | Representation |
---|---|
bin | 11101100011101000001… |
… | …100010011011100100000 |
3 | 21012011200020210220001220 |
4 | 131203220030103130200 |
5 | 231234213221300300 |
6 | 4153030024455040 |
7 | 266513023005636 |
oct | 35435014233440 |
9 | 7164606726056 |
10 | 2031120103200 |
11 | 71343638aa41 |
12 | 28978a01a480 |
13 | 1196c29c8516 |
14 | 7044198b356 |
15 | 37c7a10dda0 |
hex | 1d8e8313720 |
2031120103200 has 72 divisors (see below), whose sum is σ = 6611295943728. Its totient is φ = 541632026880.
The previous prime is 2031120103189. The next prime is 2031120103213. The reversal of 2031120103200 is 23010211302.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 2031120103200.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 423147622 + ... + 423152421.
It is an arithmetic number, because the mean of its divisors is an integer number (91823554774).
Almost surely, 22031120103200 is an apocalyptic number.
2031120103200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2031120103200 is an abundant number, since it is smaller than the sum of its proper divisors (4580175840528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2031120103200 is a wasteful number, since it uses less digits than its factorization.
2031120103200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 846300066 (or 846300053 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 2031120103200 its reverse (23010211302), we get a palindrome (2054130314502).
The spelling of 2031120103200 in words is "two trillion, thirty-one billion, one hundred twenty million, one hundred three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •