Base | Representation |
---|---|
bin | 1011000110001111111111… |
… | …1000011011001010000101 |
3 | 1121012111111100220111110111 |
4 | 2301203333320123022011 |
5 | 3044404144011231041 |
6 | 41541304345153021 |
7 | 2366364636364522 |
oct | 261437770331205 |
9 | 47174440814414 |
10 | 12202000102021 |
11 | 3984925a52284 |
12 | 14509b518b771 |
13 | 6a684a1c0682 |
14 | 302819584149 |
15 | 162606c77981 |
hex | b18ffe1b285 |
12202000102021 has 8 divisors (see below), whose sum is σ = 12236142973824. Its totient is φ = 12167896455120.
The previous prime is 12202000101983. The next prime is 12202000102037. The reversal of 12202000102021 is 12020100020221.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12202000102021 - 227 = 12201865884293 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12202000101992 and 12202000102010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12202000102121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9183145 + ... + 10427566.
It is an arithmetic number, because the mean of its divisors is an integer number (1529517871728).
Almost surely, 212202000102021 is an apocalyptic number.
It is an amenable number.
12202000102021 is a deficient number, since it is larger than the sum of its proper divisors (34142871803).
12202000102021 is a wasteful number, since it uses less digits than its factorization.
12202000102021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19612451.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 12202000102021 its reverse (12020100020221), we get a palindrome (24222100122242).
The spelling of 12202000102021 in words is "twelve trillion, two hundred two billion, one hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •