Base | Representation |
---|---|
bin | 101111100000011110… |
… | …0000010001111100111 |
3 | 100202100000220111122111 |
4 | 1133000330002033213 |
5 | 3132414412223421 |
6 | 114511244341451 |
7 | 10241115662161 |
oct | 1370074021747 |
9 | 322300814574 |
10 | 102021211111 |
11 | 3a2a334aa06 |
12 | 17932844887 |
13 | 980b4a2551 |
14 | 4d1b67b931 |
15 | 29c18dbee1 |
hex | 17c0f023e7 |
102021211111 has 8 divisors (see below), whose sum is σ = 103085205104. Its totient is φ = 100957466880.
The previous prime is 102021211093. The next prime is 102021211169. The reversal of 102021211111 is 111112120201.
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 102021211111 - 231 = 99873727463 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102021211091 and 102021211100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102021211511) 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, 823981 + ... + 939673.
It is an arithmetic number, because the mean of its divisors is an integer number (12885650638).
Almost surely, 2102021211111 is an apocalyptic number.
102021211111 is a deficient number, since it is larger than the sum of its proper divisors (1063993993).
102021211111 is an equidigital number, since it uses as much as digits as its factorization.
102021211111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124881.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 102021211111 its reverse (111112120201), we get a palindrome (213133331312).
The spelling of 102021211111 in words is "one hundred two billion, twenty-one million, two hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •