Base | Representation |
---|---|
bin | 110010010000011010001111… |
… | …011010101001000000000000 |
3 | 1001222121021002122111001210210 |
4 | 302100122033122221000000 |
5 | 212432323431324043240 |
6 | 2102031441455154120 |
7 | 64361614526335566 |
oct | 6220321732510000 |
9 | 1058537078431723 |
10 | 221030013112320 |
11 | 64477336185835 |
12 | 20959120215940 |
13 | 964406b8448b9 |
14 | 3c81ca4387a36 |
15 | 1a84770505780 |
hex | c9068f6a9000 |
221030013112320 has 208 divisors, whose sum is σ = 731596249460160. Its totient is φ = 56908876480512.
The previous prime is 221030013112319. The next prime is 221030013112357. The reversal of 221030013112320 is 23211310030122.
It is a super-2 number, since 2×2210300131123202 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 60243994 + ... + 63807513.
Almost surely, 2221030013112320 is an apocalyptic number.
221030013112320 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
221030013112320 is an abundant number, since it is smaller than the sum of its proper divisors (510566236347840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
221030013112320 is a wasteful number, since it uses less digits than its factorization.
221030013112320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124051568 (or 124051546 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 221030013112320 its reverse (23211310030122), we get a palindrome (244241323142442).
The spelling of 221030013112320 in words is "two hundred twenty-one trillion, thirty billion, thirteen million, one hundred twelve thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •