Base | Representation |
---|---|
bin | 10010110101010101… |
… | …10111001100001101 |
3 | 222002122212010022011 |
4 | 21122222313030031 |
5 | 131201421321031 |
6 | 4351152221221 |
7 | 505364050243 |
oct | 113252671415 |
9 | 28078763264 |
10 | 10111120141 |
11 | 4319511241 |
12 | 1b6223a811 |
13 | c51a25635 |
14 | 6bcc0a793 |
15 | 3e2a0c6b1 |
hex | 25aab730d |
10111120141 has 4 divisors (see below), whose sum is σ = 10705891932. Its totient is φ = 9516348352.
The previous prime is 10111120139. The next prime is 10111120163. The reversal of 10111120141 is 14102111101.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 14102111101 = 13 ⋅1084777777.
It can be written as a sum of positive squares in 2 ways, for example, as 7862368900 + 2248751241 = 88670^2 + 47421^2 .
It is a cyclic number.
It is not a de Polignac number, because 10111120141 - 21 = 10111120139 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10111120121) 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, 297385870 + ... + 297385903.
It is an arithmetic number, because the mean of its divisors is an integer number (2676472983).
Almost surely, 210111120141 is an apocalyptic number.
It is an amenable number.
10111120141 is a deficient number, since it is larger than the sum of its proper divisors (594771791).
10111120141 is an equidigital number, since it uses as much as digits as its factorization.
10111120141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 594771790.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10111120141 its reverse (14102111101), we get a palindrome (24213231242).
The spelling of 10111120141 in words is "ten billion, one hundred eleven million, one hundred twenty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •