Base | Representation |
---|---|
bin | 10100011111111101… |
… | …101110101001000010 |
3 | 2002210222210100021110 |
4 | 110133331232221002 |
5 | 330034321041002 |
6 | 14040050304150 |
7 | 1406312236125 |
oct | 243775565102 |
9 | 62728710243 |
10 | 22011112002 |
11 | 9375776260 |
12 | 4323588056 |
13 | 20ca242a39 |
14 | 10cb4343bc |
15 | 88c5c5e6c |
hex | 51ff6ea42 |
22011112002 has 64 divisors (see below), whose sum is σ = 49183884288. Its totient is φ = 6510840000.
The previous prime is 22011111971. The next prime is 22011112007. The reversal of 22011112002 is 20021111022.
It is a super-3 number, since 3×220111120023 (a number of 32 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (22011112007) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 450033 + ... + 496539.
It is an arithmetic number, because the mean of its divisors is an integer number (768498192).
Almost surely, 222011112002 is an apocalyptic number.
22011112002 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 22011112002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24591942144).
22011112002 is an abundant number, since it is smaller than the sum of its proper divisors (27172772286).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22011112002 is a wasteful number, since it uses less digits than its factorization.
22011112002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46695.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 22011112002 its reverse (20021111022), we get a palindrome (42032223024).
The spelling of 22011112002 in words is "twenty-two billion, eleven million, one hundred twelve thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •