Base | Representation |
---|---|
bin | 101111100000011101… |
… | …1100111010111011101 |
3 | 100202100000200220122002 |
4 | 1133000323213113131 |
5 | 3132414400213041 |
6 | 114511242132045 |
7 | 10241115023210 |
oct | 1370073472735 |
9 | 322300626562 |
10 | 102021101021 |
11 | 3a2a3285224 |
12 | 179327b1025 |
13 | 980b4643c8 |
14 | 4d1b64d777 |
15 | 29c18b959b |
hex | 17c0ee75dd |
102021101021 has 8 divisors (see below), whose sum is σ = 116866070784. Its totient is φ = 87243762960.
The previous prime is 102021101009. The next prime is 102021101047. The reversal of 102021101021 is 120101120201.
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 102021101021 - 214 = 102021084637 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102021100993 and 102021101011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102021101071) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 16904690 + ... + 16910723.
It is an arithmetic number, because the mean of its divisors is an integer number (14608258848).
Almost surely, 2102021101021 is an apocalyptic number.
It is an amenable number.
102021101021 is a deficient number, since it is larger than the sum of its proper divisors (14844969763).
102021101021 is an equidigital number, since it uses as much as digits as its factorization.
102021101021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33815851.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 102021101021 its reverse (120101120201), we get a palindrome (222122221222).
The spelling of 102021101021 in words is "one hundred two billion, twenty-one million, one hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •