Base | Representation |
---|---|
bin | 10100011111010111… |
… | …111011000001000110 |
3 | 2002210022010211020112 |
4 | 110133113323001012 |
5 | 330024301414342 |
6 | 14035054033022 |
7 | 1406132060540 |
oct | 243727730106 |
9 | 62708124215 |
10 | 22001201222 |
11 | 9370117130 |
12 | 43201a8772 |
13 | 20c8182980 |
14 | 10c9db4690 |
15 | 88b7b9682 |
hex | 51f5fb046 |
22001201222 has 64 divisors (see below), whose sum is σ = 44871321600. Its totient is φ = 7812305280.
The previous prime is 22001201213. The next prime is 22001201227. The reversal of 22001201222 is 22210210022.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 22001201197 and 22001201206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22001201227) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 88604 + ... + 227712.
It is an arithmetic number, because the mean of its divisors is an integer number (701114400).
Almost surely, 222001201222 is an apocalyptic number.
22001201222 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
22001201222 is an abundant number, since it is smaller than the sum of its proper divisors (22870120378).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22001201222 is a wasteful number, since it uses less digits than its factorization.
22001201222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139221.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 22001201222 its reverse (22210210022), we get a palindrome (44211411244).
The spelling of 22001201222 in words is "twenty-two billion, one million, two hundred one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •