Base | Representation |
---|---|
bin | 10010110101010101… |
… | …10100111110110101 |
3 | 222002122211122220001 |
4 | 21122222310332311 |
5 | 131201421023333 |
6 | 4351152111301 |
7 | 505364011666 |
oct | 113252647665 |
9 | 28078748801 |
10 | 10111111093 |
11 | 4319505466 |
12 | 1b62235531 |
13 | c51a21495 |
14 | 6bcc0736d |
15 | 3e2a09b7d |
hex | 25aab4fb5 |
10111111093 has 4 divisors (see below), whose sum is σ = 10301886828. Its totient is φ = 9920335360.
The previous prime is 10111111091. The next prime is 10111111103. The reversal of 10111111093 is 39011111101.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4142467044 + 5968644049 = 64362^2 + 77257^2 .
It is a cyclic number.
It is not a de Polignac number, because 10111111093 - 21 = 10111111091 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10111111093.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10111111091) 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, 95387788 + ... + 95387893.
It is an arithmetic number, because the mean of its divisors is an integer number (2575471707).
Almost surely, 210111111093 is an apocalyptic number.
It is an amenable number.
10111111093 is a deficient number, since it is larger than the sum of its proper divisors (190775735).
10111111093 is an equidigital number, since it uses as much as digits as its factorization.
10111111093 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 190775734.
The product of its (nonzero) digits is 27, while the sum is 19.
Adding to 10111111093 its reverse (39011111101), we get a palindrome (49122222194).
The spelling of 10111111093 in words is "ten billion, one hundred eleven million, one hundred eleven thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •