Base | Representation |
---|---|
bin | 10100110000000100… |
… | …00111010000001111 |
3 | 1001202102001102001102 |
4 | 22120002013100033 |
5 | 140304000003143 |
6 | 5041250133315 |
7 | 543034516334 |
oct | 123002072017 |
9 | 31672042042 |
10 | 11140625423 |
11 | 47a7657854 |
12 | 21aab8123b |
13 | 10870c3565 |
14 | 77983898b |
15 | 4530bb0b8 |
hex | 29808740f |
11140625423 has 8 divisors (see below), whose sum is σ = 11172500640. Its totient is φ = 11108796160.
The previous prime is 11140625417. The next prime is 11140625429. The reversal of 11140625423 is 32452604111.
It is an interprime number because it is at equal distance from previous prime (11140625417) and next prime (11140625429).
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 11140625423 - 26 = 11140625359 is a prime.
It is a super-2 number, since 2×111406254232 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11140625429) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 506903 + ... + 528423.
It is an arithmetic number, because the mean of its divisors is an integer number (1396562580).
Almost surely, 211140625423 is an apocalyptic number.
11140625423 is a deficient number, since it is larger than the sum of its proper divisors (31875217).
11140625423 is an equidigital number, since it uses as much as digits as its factorization.
11140625423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22977.
The product of its (nonzero) digits is 5760, while the sum is 29.
The spelling of 11140625423 in words is "eleven billion, one hundred forty million, six hundred twenty-five thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •