Base | Representation |
---|---|
bin | 11110100011111001100… |
… | …000100110011100010100 |
3 | 21102202210200022122002220 |
4 | 132203321200212130110 |
5 | 233402031302111200 |
6 | 4244441512502340 |
7 | 304505116265442 |
oct | 36437140463424 |
9 | 7382720278086 |
10 | 2100130113300 |
11 | 73a729775a3a |
12 | 29b0293aa9b0 |
13 | 12306cccc01b |
14 | 7390acddb92 |
15 | 399688694a0 |
hex | 1e8f9826714 |
2100130113300 has 72 divisors (see below), whose sum is σ = 6077081416896. Its totient is φ = 559969724160.
The previous prime is 2100130113259. The next prime is 2100130113317. The reversal of 2100130113300 is 33110310012.
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 2100130113300.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2212177 + ... + 3015623.
It is an arithmetic number, because the mean of its divisors is an integer number (84403908568).
Almost surely, 22100130113300 is an apocalyptic number.
2100130113300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2100130113300 is an abundant number, since it is smaller than the sum of its proper divisors (3976951303596).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2100130113300 is a wasteful number, since it uses less digits than its factorization.
2100130113300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 812177 (or 812170 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 2100130113300 its reverse (33110310012), we get a palindrome (2133240423312).
The spelling of 2100130113300 in words is "two trillion, one hundred billion, one hundred thirty million, one hundred thirteen thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •