Base | Representation |
---|---|
bin | 101111100000001001… |
… | …0000110110111110101 |
3 | 100202022021020002201002 |
4 | 1133000102012313311 |
5 | 3132404104020041 |
6 | 114510213013045 |
7 | 10240623364163 |
oct | 1370022066765 |
9 | 322267202632 |
10 | 102010220021 |
11 | 3a298123166 |
12 | 1792b024185 |
13 | 9809124848 |
14 | 4d1a01a233 |
15 | 29c096a59b |
hex | 17c0486df5 |
102010220021 has 8 divisors (see below), whose sum is σ = 102693892224. Its totient is φ = 101326654800.
The previous prime is 102010220003. The next prime is 102010220051. The reversal of 102010220021 is 120022010201.
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 102010220021 - 230 = 100936478197 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102010219984 and 102010220011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102010220051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3108320 + ... + 3140966.
It is an arithmetic number, because the mean of its divisors is an integer number (12836736528).
Almost surely, 2102010220021 is an apocalyptic number.
It is an amenable number.
102010220021 is a deficient number, since it is larger than the sum of its proper divisors (683672203).
102010220021 is a wasteful number, since it uses less digits than its factorization.
102010220021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53491.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 102010220021 its reverse (120022010201), we get a palindrome (222032230222).
The spelling of 102010220021 in words is "one hundred two billion, ten million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •