Base | Representation |
---|---|
bin | 1010000011100001010100… |
… | …10010000010001000011010 |
3 | 2220021210212121121222021020 |
4 | 11001300222102002020122 |
5 | 10344232214424311302 |
6 | 115005425010423310 |
7 | 4441324113353613 |
oct | 501605222021032 |
9 | 86253777558236 |
10 | 22111201010202 |
11 | 7055342594747 |
12 | 2591370591b36 |
13 | c45100b01215 |
14 | 56628b604c0a |
15 | 28526a5e5ebc |
hex | 141c2a48221a |
22111201010202 has 8 divisors (see below), whose sum is σ = 44222402020416. Its totient is φ = 7370400336732.
The previous prime is 22111201010189. The next prime is 22111201010209. The reversal of 22111201010202 is 20201010211122.
It is a sphenic number, since it is the product of 3 distinct primes.
22111201010202 is an admirable number.
It is a super-2 number, since 2×221112010102022 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (22111201010209) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1842600084178 + ... + 1842600084189.
It is an arithmetic number, because the mean of its divisors is an integer number (5527800252552).
Almost surely, 222111201010202 is an apocalyptic number.
22111201010202 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22111201010202 is a wasteful number, since it uses less digits than its factorization.
22111201010202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3685200168372.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 22111201010202 its reverse (20201010211122), we get a palindrome (42312211221324).
The spelling of 22111201010202 in words is "twenty-two trillion, one hundred eleven billion, two hundred one million, ten thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •