Base | Representation |
---|---|
bin | 110010000001111000001001… |
… | …010101111100100110111100 |
3 | 1001212001210022210111122110121 |
4 | 302001320021111330212330 |
5 | 212314443131304303200 |
6 | 2055544555334344324 |
7 | 64226511336232411 |
oct | 6201701125744674 |
9 | 1055053283448417 |
10 | 220031331322300 |
11 | 64121844365583 |
12 | 208176677bb0a4 |
13 | 95a0b336bb784 |
14 | 3c49805042108 |
15 | 1a687be879e1a |
hex | c81e0957c9bc |
220031331322300 has 36 divisors (see below), whose sum is σ = 477703311237880. Its totient is φ = 87969155152320.
The previous prime is 220031331322291. The next prime is 220031331322349. The reversal of 220031331322300 is 3223133130022.
It is a Harshad number since it is a multiple of its sum of digits (25).
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 11 ways as a sum of consecutive naturals, for example, 542013294 + ... + 542419093.
Almost surely, 2220031331322300 is an apocalyptic number.
220031331322300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
220031331322300 is an abundant number, since it is smaller than the sum of its proper divisors (257671979915580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220031331322300 is a wasteful number, since it uses less digits than its factorization.
220031331322300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1084434430 (or 1084434423 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 220031331322300 its reverse (3223133130022), we get a palindrome (223254464452322).
The spelling of 220031331322300 in words is "two hundred twenty trillion, thirty-one billion, three hundred thirty-one million, three hundred twenty-two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •