Base | Representation |
---|---|
bin | 101111100101110111… |
… | …0011111011011100101 |
3 | 100202210122111012110211 |
4 | 1133023232133123211 |
5 | 3133302231210041 |
6 | 114541232015421 |
7 | 10245444310612 |
oct | 1371356373345 |
9 | 322718435424 |
10 | 102202210021 |
11 | 3a38653508a |
12 | 17983391571 |
13 | 9839b35cb2 |
14 | 4d37715509 |
15 | 29d2741481 |
hex | 17cbb9f6e5 |
102202210021 has 8 divisors (see below), whose sum is σ = 102963230784. Its totient is φ = 101441407200.
The previous prime is 102202209953. The next prime is 102202210043. The reversal of 102202210021 is 120012202201.
102202210021 = 272452 + 272462 + ... + 273812.
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 a de Polignac number, because none of the positive numbers 2k-102202210021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102202209983 and 102202210010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102202210051) 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, 956346 + ... + 1057828.
It is an arithmetic number, because the mean of its divisors is an integer number (12870403848).
Almost surely, 2102202210021 is an apocalyptic number.
It is an amenable number.
102202210021 is a deficient number, since it is larger than the sum of its proper divisors (761020763).
102202210021 is a wasteful number, since it uses less digits than its factorization.
102202210021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108971.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 102202210021 its reverse (120012202201), we get a palindrome (222214412222).
The spelling of 102202210021 in words is "one hundred two billion, two hundred two million, two hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •