Base | Representation |
---|---|
bin | 100000011111111100110… |
… | …101110110100010110100 |
3 | 21220111121121102001221201 |
4 | 200133330311312202310 |
5 | 243042324440031400 |
6 | 4425551100422244 |
7 | 320231666540611 |
oct | 40377465664264 |
9 | 7814547361851 |
10 | 2233330002100 |
11 | 79117162196a |
12 | 300a01847984 |
13 | 1327a9b03882 |
14 | 7a145365508 |
15 | 3d1625a806a |
hex | 207fcd768b4 |
2233330002100 has 18 divisors (see below), whose sum is σ = 4846326104774. Its totient is φ = 893332000800.
The previous prime is 2233330002073. The next prime is 2233330002119. The reversal of 2233330002100 is 12000333322.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 17864460964 + 2215465541136 = 133658^2 + 1488444^2 .
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 11166649911 + ... + 11166650110.
Almost surely, 22233330002100 is an apocalyptic number.
2233330002100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2233330002100 is an abundant number, since it is smaller than the sum of its proper divisors (2612996102674).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2233330002100 is a wasteful number, since it uses less digits than its factorization.
2233330002100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22333300035 (or 22333300028 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 19.
Adding to 2233330002100 its reverse (12000333322), we get a palindrome (2245330335422).
The spelling of 2233330002100 in words is "two trillion, two hundred thirty-three billion, three hundred thirty million, two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •