Base | Representation |
---|---|
bin | 10100110000000011… |
… | …01011110111000111 |
3 | 1001202101211201010212 |
4 | 22120001223313013 |
5 | 140303432410343 |
6 | 5041243510035 |
7 | 543033541250 |
oct | 123001536707 |
9 | 31671751125 |
10 | 11140513223 |
11 | 47a7590524 |
12 | 21aab2831b |
13 | 1087084478 |
14 | 779809b27 |
15 | 453097c18 |
hex | 29806bdc7 |
11140513223 has 8 divisors (see below), whose sum is σ = 12744160800. Its totient is φ = 9539902080.
The previous prime is 11140513213. The next prime is 11140513271. The reversal of 11140513223 is 32231504111.
11140513223 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11140513223 is a prime.
It is a super-2 number, since 2×111405132232 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11140513213) 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 7 ways as a sum of consecutive naturals, for example, 751238 + ... + 765923.
It is an arithmetic number, because the mean of its divisors is an integer number (1593020100).
Almost surely, 211140513223 is an apocalyptic number.
11140513223 is a deficient number, since it is larger than the sum of its proper divisors (1603647577).
11140513223 is a wasteful number, since it uses less digits than its factorization.
11140513223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1518217.
The product of its (nonzero) digits is 720, while the sum is 23.
The spelling of 11140513223 in words is "eleven billion, one hundred forty million, five hundred thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •