Base | Representation |
---|---|
bin | 100000010110011100111… |
… | …000000011000011011100 |
3 | 21212112021202100211002101 |
4 | 200112130320003003130 |
5 | 242410432241432200 |
6 | 4421143011534444 |
7 | 316421143316524 |
oct | 40263470030334 |
9 | 7775252324071 |
10 | 2223130030300 |
11 | 787907a44103 |
12 | 2baa358ba424 |
13 | 13184286bbba |
14 | 7985882a684 |
15 | 3cc66d9926a |
hex | 2059ce030dc |
2223130030300 has 72 divisors (see below), whose sum is σ = 5078567312000. Its totient is φ = 842371254720.
The previous prime is 2223130030241. The next prime is 2223130030307. The reversal of 2223130030300 is 30300313222.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2223130030307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 23061601 + ... + 23157799.
Almost surely, 22223130030300 is an apocalyptic number.
2223130030300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2223130030300 is an abundant number, since it is smaller than the sum of its proper divisors (2855437281700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2223130030300 is a wasteful number, since it uses less digits than its factorization.
2223130030300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108395 (or 108388 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 19.
Adding to 2223130030300 its reverse (30300313222), we get a palindrome (2253430343522).
The spelling of 2223130030300 in words is "two trillion, two hundred twenty-three billion, one hundred thirty million, thirty thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •