Base | Representation |
---|---|
bin | 10010110101010101… |
… | …10100111111001001 |
3 | 222002122211122220210 |
4 | 21122222310333021 |
5 | 131201421023423 |
6 | 4351152111333 |
7 | 505364012025 |
oct | 113252647711 |
9 | 28078748823 |
10 | 10111111113 |
11 | 4319505484 |
12 | 1b62235549 |
13 | c51a214ac |
14 | 6bcc07385 |
15 | 3e2a09b93 |
hex | 25aab4fc9 |
10111111113 has 4 divisors (see below), whose sum is σ = 13481481488. Its totient is φ = 6740740740.
The previous prime is 10111111103. The next prime is 10111111159. The reversal of 10111111113 is 31111111101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 10111111113 - 28 = 10111110857 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10111111103) 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 3 ways as a sum of consecutive naturals, for example, 1685185183 + ... + 1685185188.
It is an arithmetic number, because the mean of its divisors is an integer number (3370370372).
Almost surely, 210111111113 is an apocalyptic number.
It is an amenable number.
10111111113 is a deficient number, since it is larger than the sum of its proper divisors (3370370375).
10111111113 is an equidigital number, since it uses as much as digits as its factorization.
10111111113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3370370374.
The product of its (nonzero) digits is 3, while the sum is 12.
Subtracting from 10111111113 its sum of digits (12), we obtain a palindrome (10111111101).
Adding to 10111111113 its reverse (31111111101), we get a palindrome (41222222214).
The spelling of 10111111113 in words is "ten billion, one hundred eleven million, one hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •