Base | Representation |
---|---|
bin | 10100101011010011… |
… | …010000000100010000 |
3 | 2010022020200001201001 |
4 | 110223103100010100 |
5 | 330432013201222 |
6 | 14111002551344 |
7 | 1414111651546 |
oct | 245323200420 |
9 | 63266601631 |
10 | 22201303312 |
11 | 9463069861 |
12 | 4377208554 |
13 | 212a774586 |
14 | 11087c1d96 |
15 | 89e143e27 |
hex | 52b4d0110 |
22201303312 has 160 divisors (see below), whose sum is σ = 47426964480. Its totient is φ = 10033943040.
The previous prime is 22201303291. The next prime is 22201303417. The reversal of 22201303312 is 21330310222.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a self number, because there is not a number n which added to its sum of digits gives 22201303312.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 132941853 + ... + 132942019.
It is an arithmetic number, because the mean of its divisors is an integer number (296418528).
Almost surely, 222201303312 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 22201303312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23713482240).
22201303312 is an abundant number, since it is smaller than the sum of its proper divisors (25225661168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22201303312 is a wasteful number, since it uses less digits than its factorization.
22201303312 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 429 (or 423 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 22201303312 its reverse (21330310222), we get a palindrome (43531613534).
The spelling of 22201303312 in words is "twenty-two billion, two hundred one million, three hundred three thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •