Base | Representation |
---|---|
bin | 10010110101010101… |
… | …10101000000101101 |
3 | 222002122211200001111 |
4 | 21122222311000231 |
5 | 131201421024323 |
6 | 4351152112021 |
7 | 505364012230 |
oct | 113252650055 |
9 | 28078750044 |
10 | 10111111213 |
11 | 4319505565 |
12 | 1b62235611 |
13 | c51a21558 |
14 | 6bcc07417 |
15 | 3e2a09c0d |
hex | 25aab502d |
10111111213 has 8 divisors (see below), whose sum is σ = 12057971328. Its totient is φ = 8289855024.
The previous prime is 10111111189. The next prime is 10111111237. The reversal of 10111111213 is 31211111101.
It is an interprime number because it is at equal distance from previous prime (10111111189) and next prime (10111111237).
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 10111111213 - 29 = 10111110701 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10111111193 and 10111111202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10111111273) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 31400806 + ... + 31401127.
It is an arithmetic number, because the mean of its divisors is an integer number (1507246416).
Almost surely, 210111111213 is an apocalyptic number.
It is an amenable number.
10111111213 is a deficient number, since it is larger than the sum of its proper divisors (1946860115).
10111111213 is an equidigital number, since it uses as much as digits as its factorization.
10111111213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62801963.
The product of its (nonzero) digits is 6, while the sum is 13.
Adding to 10111111213 its reverse (31211111101), we get a palindrome (41322222314).
The spelling of 10111111213 in words is "ten billion, one hundred eleven million, one hundred eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •