Base | Representation |
---|---|
bin | 10100101101001101… |
… | …000000011110010010 |
3 | 2010101110201122120000 |
4 | 110231031000132102 |
5 | 331013201033020 |
6 | 14114103030430 |
7 | 1414650155220 |
oct | 245515003622 |
9 | 63343648500 |
10 | 22233221010 |
11 | 947a08a020 |
12 | 4385a3b416 |
13 | 213426b3a0 |
14 | 110cb2db10 |
15 | 8a1d4b090 |
hex | 52d340792 |
22233221010 has 640 divisors, whose sum is σ = 85041944064. Its totient is φ = 4011171840.
The previous prime is 22233220991. The next prime is 22233221033. The reversal of 22233221010 is 1012233222.
It is a super-4 number, since 4×222332210104 (a number of 42 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 319 ways as a sum of consecutive naturals, for example, 13782964 + ... + 13784576.
Almost surely, 222233221010 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 22233221010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (42520972032).
22233221010 is an abundant number, since it is smaller than the sum of its proper divisors (62808723054).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22233221010 is a wasteful number, since it uses less digits than its factorization.
22233221010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1680 (or 1671 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 22233221010 its reverse (1012233222), we get a palindrome (23245454232).
It can be divided in two parts, 222332 and 21010, that added together give a palindrome (243342).
The spelling of 22233221010 in words is "twenty-two billion, two hundred thirty-three million, two hundred twenty-one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •