Base | Representation |
---|---|
bin | 10100101110000110… |
… | …01100100101110101 |
3 | 1001201021000110121210 |
4 | 22113003030211311 |
5 | 140240234212323 |
6 | 5035500432033 |
7 | 542444364225 |
oct | 122703144565 |
9 | 31637013553 |
10 | 11124132213 |
11 | 47993121a7 |
12 | 21a5548619 |
13 | 108386a36c |
14 | 777584085 |
15 | 45190e293 |
hex | 2970cc975 |
11124132213 has 16 divisors (see below), whose sum is σ = 14880208896. Its totient is φ = 7392110640.
The previous prime is 11124132193. The next prime is 11124132221. The reversal of 11124132213 is 31223142111.
11124132213 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 11124132213 - 210 = 11124131189 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11124132213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11124132233) 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 15 ways as a sum of consecutive naturals, for example, 1334328 + ... + 1342638.
It is an arithmetic number, because the mean of its divisors is an integer number (930013056).
Almost surely, 211124132213 is an apocalyptic number.
It is an amenable number.
11124132213 is a deficient number, since it is larger than the sum of its proper divisors (3756076683).
11124132213 is an equidigital number, since it uses as much as digits as its factorization.
11124132213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9704.
The product of its digits is 288, while the sum is 21.
Adding to 11124132213 its reverse (31223142111), we get a palindrome (42347274324).
The spelling of 11124132213 in words is "eleven billion, one hundred twenty-four million, one hundred thirty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •