Base | Representation |
---|---|
bin | 101101111110100100101100… |
… | …111111000101111110010101 |
3 | 222111222021210121212100001012 |
4 | 231332210230333011332111 |
5 | 203001020400130000041 |
6 | 1554022543315542005 |
7 | 60410225410135232 |
oct | 5576445477057625 |
9 | 874867717770035 |
10 | 202212110000021 |
11 | 59481746488610 |
12 | 1a81a08a5ba905 |
13 | 88aa69ba0c2b4 |
14 | 37d1192a48789 |
15 | 185a00373e3eb |
hex | b7e92cfc5f95 |
202212110000021 has 16 divisors (see below), whose sum is σ = 221663018199168. Its totient is φ = 182941116019200.
The previous prime is 202212109999997. The next prime is 202212110000053. The reversal of 202212110000021 is 120000011212202.
It is a de Polignac number, because none of the positive numbers 2k-202212110000021 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 202212109999960 and 202212110000005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202212110000321) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 45789620 + ... + 50011133.
It is an arithmetic number, because the mean of its divisors is an integer number (13853938637448).
Almost surely, 2202212110000021 is an apocalyptic number.
It is an amenable number.
202212110000021 is a deficient number, since it is larger than the sum of its proper divisors (19450908199147).
202212110000021 is a wasteful number, since it uses less digits than its factorization.
202212110000021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 95801692.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 202212110000021 its reverse (120000011212202), we get a palindrome (322212121212223).
The spelling of 202212110000021 in words is "two hundred two trillion, two hundred twelve billion, one hundred ten million, twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •