Base | Representation |
---|---|
bin | 1010000110101100100011… |
… | …10100100101001010011000 |
3 | 2220200020111202202220111022 |
4 | 11003112101310211022120 |
5 | 10403024144422132412 |
6 | 115131512012222012 |
7 | 4452236024136002 |
oct | 503262164451230 |
9 | 86606452686438 |
10 | 22220312302232 |
11 | 7097644015360 |
12 | 25aa54176a908 |
13 | c5249c159405 |
14 | 56b67c76b372 |
15 | 288004692a72 |
hex | 143591d25298 |
22220312302232 has 64 divisors (see below), whose sum is σ = 45560869956000. Its totient is φ = 10075656637440.
The previous prime is 22220312302229. The next prime is 22220312302247. The reversal of 22220312302232 is 23220321302222.
It is a super-2 number, since 2×222203123022322 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 175801394 + ... + 175927742.
Almost surely, 222220312302232 is an apocalyptic number.
22220312302232 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
22220312302232 is an abundant number, since it is smaller than the sum of its proper divisors (23340557653768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22220312302232 is a wasteful number, since it uses less digits than its factorization.
22220312302232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131196 (or 131192 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 26.
Adding to 22220312302232 its reverse (23220321302222), we get a palindrome (45440633604454).
The spelling of 22220312302232 in words is "twenty-two trillion, two hundred twenty billion, three hundred twelve million, three hundred two thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •