Base | Representation |
---|---|
bin | 10100110010011000… |
… | …011101111000011100 |
3 | 2010121112020010101200 |
4 | 110302120131320130 |
5 | 331202422024012 |
6 | 14130445235500 |
7 | 1420053546204 |
oct | 246230357034 |
9 | 63545203350 |
10 | 22320111132 |
11 | 9514136940 |
12 | 43aab62b90 |
13 | 2149271967 |
14 | 111a4ab404 |
15 | 8a97b13dc |
hex | 53261de1c |
22320111132 has 36 divisors (see below), whose sum is σ = 61549398456. Its totient is φ = 6763669920.
The previous prime is 22320111109. The next prime is 22320111161. The reversal of 22320111132 is 23111102322.
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-3 number, since 3×223201111323 (a number of 32 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
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 11 ways as a sum of consecutive naturals, for example, 28181563 + ... + 28182354.
Almost surely, 222320111132 is an apocalyptic number.
22320111132 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
22320111132 is an abundant number, since it is smaller than the sum of its proper divisors (39229287324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22320111132 is a wasteful number, since it uses less digits than its factorization.
22320111132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56363938 (or 56363933 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 22320111132 its reverse (23111102322), we get a palindrome (45431213454).
The spelling of 22320111132 in words is "twenty-two billion, three hundred twenty million, one hundred eleven thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •