Base | Representation |
---|---|
bin | 1010001001110110111010… |
… | …1100110000001101111111 |
3 | 1110112022110121120120101000 |
4 | 2202131232230300031333 |
5 | 2430404322132243103 |
6 | 35424520125221343 |
7 | 2231415103434156 |
oct | 242355654601577 |
9 | 43468417516330 |
10 | 11164477227903 |
11 | 361491237971a |
12 | 1303900a01853 |
13 | 62ca6212334c |
14 | 2a851394859d |
15 | 145631237aa3 |
hex | a276eb3037f |
11164477227903 has 8 divisors (see below), whose sum is σ = 16539966263600. Its totient is φ = 7442984818584.
The previous prime is 11164477227899. The next prime is 11164477227941. The reversal of 11164477227903 is 30972277446111.
11164477227903 is a `hidden beast` number, since 1 + 1 + 1 + 64 + 477 + 2 + 27 + 90 + 3 = 666.
It is not a de Polignac number, because 11164477227903 - 22 = 11164477227899 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11164477227903.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11164477217903) 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, 206749578268 + ... + 206749578321.
It is an arithmetic number, because the mean of its divisors is an integer number (2067495782950).
Almost surely, 211164477227903 is an apocalyptic number.
11164477227903 is a deficient number, since it is larger than the sum of its proper divisors (5375489035697).
11164477227903 is an equidigital number, since it uses as much as digits as its factorization.
11164477227903 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 413499156598 (or 413499156592 counting only the distinct ones).
The product of its (nonzero) digits is 3556224, while the sum is 54.
The spelling of 11164477227903 in words is "eleven trillion, one hundred sixty-four billion, four hundred seventy-seven million, two hundred twenty-seven thousand, nine hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.313 sec. • engine limits •