Base | Representation |
---|---|
bin | 10111001100010011110101… |
… | …011000101000010111001111 |
3 | 111101011012102002020211022002 |
4 | 113030103311120220113033 |
5 | 101332141022024020421 |
6 | 1000534340153542515 |
7 | 30325220605316036 |
oct | 2714236530502717 |
9 | 441135362224262 |
10 | 102001000220111 |
11 | 2a556421511153 |
12 | b534588714a3b |
13 | 44bb864993725 |
14 | 1b28c3646971d |
15 | bbd4304c3b0b |
hex | 5cc4f56285cf |
102001000220111 has 4 divisors (see below), whose sum is σ = 105518276089800. Its totient is φ = 98483724350424.
The previous prime is 102001000220099. The next prime is 102001000220117. The reversal of 102001000220111 is 111022000100201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102001000220111 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102001000220092 and 102001000220101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102001000220117) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1758637934801 + ... + 1758637934858.
It is an arithmetic number, because the mean of its divisors is an integer number (26379569022450).
Almost surely, 2102001000220111 is an apocalyptic number.
102001000220111 is a deficient number, since it is larger than the sum of its proper divisors (3517275869689).
102001000220111 is an equidigital number, since it uses as much as digits as its factorization.
102001000220111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3517275869688.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 102001000220111 its reverse (111022000100201), we get a palindrome (213023000320312).
The spelling of 102001000220111 in words is "one hundred two trillion, one billion, two hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •