Base | Representation |
---|---|
bin | 1010000011100011001011… |
… | …10101101110010100110010 |
3 | 2220021220110020211012011200 |
4 | 11001301211311232110302 |
5 | 10344241241224101002 |
6 | 115010112103152030 |
7 | 4441360635462552 |
oct | 501614565562462 |
9 | 86256406735150 |
10 | 22112200222002 |
11 | 705580561a320 |
12 | 25915ab145616 |
13 | c4522cb236c7 |
14 | 5663441c9162 |
15 | 2852c81bdb1c |
hex | 141c65d6e532 |
22112200222002 has 48 divisors (see below), whose sum is σ = 52664171582880. Its totient is φ = 6649516598400.
The previous prime is 22112200221971. The next prime is 22112200222031. The reversal of 22112200222002 is 20022200221122.
22112200222002 is a `hidden beast` number, since 221 + 1 + 220 + 0 + 2 + 220 + 0 + 2 = 666.
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 23 ways as a sum of consecutive naturals, for example, 426225127 + ... + 426277002.
It is an arithmetic number, because the mean of its divisors is an integer number (1097170241310).
Almost surely, 222112200222002 is an apocalyptic number.
22112200222002 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
22112200222002 is an abundant number, since it is smaller than the sum of its proper divisors (30551971360878).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22112200222002 is a wasteful number, since it uses less digits than its factorization.
22112200222002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 852502279 (or 852502276 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 18.
Adding to 22112200222002 its reverse (20022200221122), we get a palindrome (42134400443124).
The spelling of 22112200222002 in words is "twenty-two trillion, one hundred twelve billion, two hundred million, two hundred twenty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •