Base | Representation |
---|---|
bin | 11110100110110010010… |
… | …001101111011110011100 |
3 | 21110001210201022100111020 |
4 | 132212302101233132130 |
5 | 233424403340044400 |
6 | 4250113250124140 |
7 | 304645000024152 |
oct | 36466221573634 |
9 | 7401721270436 |
10 | 2103230003100 |
11 | 740a7a562036 |
12 | 29b753580650 |
13 | 1234452b8b45 |
14 | 73b228a93d2 |
15 | 39a9aa902a0 |
hex | 1e9b246f79c |
2103230003100 has 72 divisors (see below), whose sum is σ = 6085491264048. Its totient is φ = 560847897600.
The previous prime is 2103230003057. The next prime is 2103230003113. The reversal of 2103230003100 is 13000323012.
It is a super-2 number, since 2×21032300031002 (a number of 25 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 2103230003100.
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, 23211082 + ... + 23301518.
Almost surely, 22103230003100 is an apocalyptic number.
2103230003100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2103230003100 is an abundant number, since it is smaller than the sum of its proper divisors (3982261260948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2103230003100 is a wasteful number, since it uses less digits than its factorization.
2103230003100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 167975 (or 167968 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 2103230003100 its reverse (13000323012), we get a palindrome (2116230326112).
The spelling of 2103230003100 in words is "two trillion, one hundred three billion, two hundred thirty million, three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •