Base | Representation |
---|---|
bin | 10011000010010101… |
… | …01000010010100011 |
3 | 222101020221102200001 |
4 | 21201022220102203 |
5 | 131412322023021 |
6 | 4410044240431 |
7 | 511156340005 |
oct | 114112502243 |
9 | 28336842601 |
10 | 10220111011 |
11 | 4374a93740 |
12 | 1b92840117 |
13 | c6b496586 |
14 | 6cd49c375 |
15 | 3ec38b091 |
hex | 2612a84a3 |
10220111011 has 8 divisors (see below), whose sum is σ = 11149944048. Its totient is φ = 9290400000.
The previous prime is 10220111003. The next prime is 10220111047. The reversal of 10220111011 is 11011102201.
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 10220111011 - 23 = 10220111003 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10220111411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 307611 + ... + 339211.
It is an arithmetic number, because the mean of its divisors is an integer number (1393743006).
Almost surely, 210220111011 is an apocalyptic number.
10220111011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10220111011 is a deficient number, since it is larger than the sum of its proper divisors (929833037).
10220111011 is a wasteful number, since it uses less digits than its factorization.
10220111011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61013.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 10220111011 its reverse (11011102201), we get a palindrome (21231213212).
It can be divided in two parts, 102201 and 11011, that multiplied together give a palindrome (1125335211).
The spelling of 10220111011 in words is "ten billion, two hundred twenty million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •