Base | Representation |
---|---|
bin | 10100101100101100… |
… | …11111110000000101 |
3 | 1001200102222010112210 |
4 | 22112112133300011 |
5 | 140224234223323 |
6 | 5034401334033 |
7 | 542242651035 |
oct | 122626376005 |
9 | 31612863483 |
10 | 11112414213 |
11 | 47927392aa |
12 | 21a1637319 |
13 | 10812c6834 |
14 | 775bb38c5 |
15 | 450897293 |
hex | 29659fc05 |
11112414213 has 32 divisors (see below), whose sum is σ = 15736008960. Its totient is φ = 6962941440.
The previous prime is 11112414167. The next prime is 11112414227. The reversal of 11112414213 is 31241421111.
11112414213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11112414213 - 26 = 11112414149 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11112414213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11112414113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1733931 + ... + 1740327.
It is an arithmetic number, because the mean of its divisors is an integer number (491750280).
Almost surely, 211112414213 is an apocalyptic number.
It is an amenable number.
11112414213 is a deficient number, since it is larger than the sum of its proper divisors (4623594747).
11112414213 is a wasteful number, since it uses less digits than its factorization.
11112414213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6957.
The product of its digits is 192, while the sum is 21.
Adding to 11112414213 its reverse (31241421111), we get a palindrome (42353835324).
The spelling of 11112414213 in words is "eleven billion, one hundred twelve million, four hundred fourteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •