Base | Representation |
---|---|
bin | 100001011111000101011… |
… | …100111100100101011100 |
3 | 22010222121000122002110220 |
4 | 201133011130330211130 |
5 | 300200143232444400 |
6 | 4521041532001340 |
7 | 325151621666565 |
oct | 41370534744534 |
9 | 8128530562426 |
10 | 2301120203100 |
11 | 807999401274 |
12 | 311b80600250 |
13 | 138cc1498644 |
14 | 7d5366ad16c |
15 | 3eccdbb37a0 |
hex | 217c573c95c |
2301120203100 has 72 divisors (see below), whose sum is σ = 6658152184320. Its totient is φ = 613609529280.
The previous prime is 2301120203089. The next prime is 2301120203113. The reversal of 2301120203100 is 13020211032.
It is a super-2 number, since 2×23011202031002 (a number of 26 digits) contains 22 as substring.
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 2301120203100.
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, 9042199 + ... + 9293201.
Almost surely, 22301120203100 is an apocalyptic number.
2301120203100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2301120203100 is an abundant number, since it is smaller than the sum of its proper divisors (4357031981220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2301120203100 is a wasteful number, since it uses less digits than its factorization.
2301120203100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 281579 (or 281572 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 2301120203100 its reverse (13020211032), we get a palindrome (2314140414132).
The spelling of 2301120203100 in words is "two trillion, three hundred one billion, one hundred twenty million, two hundred three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •