Base | Representation |
---|---|
bin | 10111001100100110011110… |
… | …101101111010111111001111 |
3 | 111101020010002100220211210012 |
4 | 113030212132231322333033 |
5 | 101333003022340120421 |
6 | 1000551450545103435 |
7 | 30326530002313244 |
oct | 2714463655727717 |
9 | 441203070824705 |
10 | 102021021020111 |
11 | 2a563965757556 |
12 | b538435627b7b |
13 | 44c070577194b |
14 | 1b29bb54075cb |
15 | bbdc02e9c95b |
hex | 5cc99eb7afcf |
102021021020111 has 8 divisors (see below), whose sum is σ = 103052076184800. Its totient is φ = 100990376562400.
The previous prime is 102021021020053. The next prime is 102021021020119. The reversal of 102021021020111 is 111020120120201.
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-102021021020111 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102021021020119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 102177416 + ... + 103171053.
It is an arithmetic number, because the mean of its divisors is an integer number (12881509523100).
Almost surely, 2102021021020111 is an apocalyptic number.
102021021020111 is a deficient number, since it is larger than the sum of its proper divisors (1031055164689).
102021021020111 is a wasteful number, since it uses less digits than its factorization.
102021021020111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 205353489.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 102021021020111 its reverse (111020120120201), we get a palindrome (213041141140312).
The spelling of 102021021020111 in words is "one hundred two trillion, twenty-one billion, twenty-one million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.217 sec. • engine limits •