Base | Representation |
---|---|
bin | 1001100110011100100011… |
… | …10110010101110010110010 |
3 | 2202202022022022001120022200 |
4 | 10303032101312111302302 |
5 | 10231400302031414302 |
6 | 112522452124044030 |
7 | 4306210163162052 |
oct | 463162166256262 |
9 | 82668268046280 |
10 | 21112211201202 |
11 | 67aa702913250 |
12 | 244b830993616 |
13 | ba1b46c00344 |
14 | 52db9d3dd562 |
15 | 26929c8c581c |
hex | 133391d95cb2 |
21112211201202 has 48 divisors (see below), whose sum is σ = 49919205836448. Its totient is φ = 6395381331840.
The previous prime is 21112211201131. The next prime is 21112211201239. The reversal of 21112211201202 is 20210211221112.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 18257868 + ... + 19379735.
It is an arithmetic number, because the mean of its divisors is an integer number (1039983454926).
Almost surely, 221112211201202 is an apocalyptic number.
21112211201202 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
21112211201202 is an abundant number, since it is smaller than the sum of its proper divisors (28806994635246).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21112211201202 is a wasteful number, since it uses less digits than its factorization.
21112211201202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37640455 (or 37640452 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 21112211201202 its reverse (20210211221112), we get a palindrome (41322422422314).
The spelling of 21112211201202 in words is "twenty-one trillion, one hundred twelve billion, two hundred eleven million, two hundred one thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •