Base | Representation |
---|---|
bin | 10100101101010011… |
… | …01110101010110011 |
3 | 1001200210110021122112 |
4 | 22112221232222303 |
5 | 140232032043201 |
6 | 5035101355535 |
7 | 542333550212 |
oct | 122651565263 |
9 | 31623407575 |
10 | 11117456051 |
11 | 4795572309 |
12 | 21a3268bab |
13 | 1082370680 |
14 | 776727079 |
15 | 4510410bb |
hex | 296a6eab3 |
11117456051 has 32 divisors (see below), whose sum is σ = 12817828800. Its totient is φ = 9551867904.
The previous prime is 11117456041. The next prime is 11117456069. The reversal of 11117456051 is 15065471111.
It is not a de Polignac number, because 11117456051 - 230 = 10043714227 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11117455999 and 11117456017.
It is not an unprimeable number, because it can be changed into a prime (11117456011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9318311 + ... + 9319503.
It is an arithmetic number, because the mean of its divisors is an integer number (400557150).
Almost surely, 211117456051 is an apocalyptic number.
11117456051 is a deficient number, since it is larger than the sum of its proper divisors (1700372749).
11117456051 is a wasteful number, since it uses less digits than its factorization.
11117456051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1655.
The product of its (nonzero) digits is 4200, while the sum is 32.
The spelling of 11117456051 in words is "eleven billion, one hundred seventeen million, four hundred fifty-six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •