Base | Representation |
---|---|
bin | 10100100111000111… |
… | …111010010111110000 |
3 | 2010010100210120012220 |
4 | 110213013322113300 |
5 | 330311043101000 |
6 | 14100020521040 |
7 | 1412301166056 |
oct | 244707722760 |
9 | 63110716186 |
10 | 22131222000 |
11 | 9427552718 |
12 | 4357850180 |
13 | 21190a7a44 |
14 | 10dd37c1d6 |
15 | 897dee1a0 |
hex | 5271fa5f0 |
22131222000 has 80 divisors (see below), whose sum is σ = 71351079072. Its totient is φ = 5901657600.
The previous prime is 22131221969. The next prime is 22131222011. The reversal of 22131222000 is 22213122.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (15).
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, 1838269 + ... + 1850268.
Almost surely, 222131222000 is an apocalyptic number.
22131222000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22131222000 is an abundant number, since it is smaller than the sum of its proper divisors (49219857072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22131222000 is a wasteful number, since it uses less digits than its factorization.
22131222000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3688563 (or 3688547 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 22131222000 its reverse (22213122), we get a palindrome (22153435122).
It can be divided in two parts, 2213122 and 2000, that added together give a palindrome (2215122).
The spelling of 22131222000 in words is "twenty-two billion, one hundred thirty-one million, two hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •