Base | Representation |
---|---|
bin | 10100101000011010… |
… | …10011001010011111 |
3 | 1001120221021220110011 |
4 | 22110031103022133 |
5 | 140141032331202 |
6 | 5031034424051 |
7 | 541325156005 |
oct | 122415231237 |
9 | 31527256404 |
10 | 11076448927 |
11 | 4774404025 |
12 | 2191592027 |
13 | 1076a135bb |
14 | 7710d0a75 |
15 | 44c640bd7 |
hex | 29435329f |
11076448927 has 2 divisors, whose sum is σ = 11076448928. Its totient is φ = 11076448926.
The previous prime is 11076448919. The next prime is 11076448963. The reversal of 11076448927 is 72984467011.
11076448927 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11076448927 - 23 = 11076448919 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11076448027) 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 as a sum of consecutive naturals, namely, 5538224463 + 5538224464.
It is an arithmetic number, because the mean of its divisors is an integer number (5538224464).
Almost surely, 211076448927 is an apocalyptic number.
11076448927 is a deficient number, since it is larger than the sum of its proper divisors (1).
11076448927 is an equidigital number, since it uses as much as digits as its factorization.
11076448927 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 677376, while the sum is 49.
The spelling of 11076448927 in words is "eleven billion, seventy-six million, four hundred forty-eight thousand, nine hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •