Base | Representation |
---|---|
bin | 10101100111011010… |
… | …10100000100100111 |
3 | 1002221202201202222121 |
4 | 22303231110010213 |
5 | 142231330404301 |
6 | 5155314010411 |
7 | 560403214411 |
oct | 126355240447 |
9 | 32852652877 |
10 | 11604934951 |
11 | 4a15757435 |
12 | 22ba576a07 |
13 | 112c36051c |
14 | 7c137d9b1 |
15 | 47dc343a1 |
hex | 2b3b54127 |
11604934951 has 2 divisors, whose sum is σ = 11604934952. Its totient is φ = 11604934950.
The previous prime is 11604934933. The next prime is 11604934997. The reversal of 11604934951 is 15943940611.
11604934951 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 11604934951 - 211 = 11604932903 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11604934898 and 11604934907.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11604934921) 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, 5802467475 + 5802467476.
It is an arithmetic number, because the mean of its divisors is an integer number (5802467476).
Almost surely, 211604934951 is an apocalyptic number.
11604934951 is a deficient number, since it is larger than the sum of its proper divisors (1).
11604934951 is an equidigital number, since it uses as much as digits as its factorization.
11604934951 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 116640, while the sum is 43.
The spelling of 11604934951 in words is "eleven billion, six hundred four million, nine hundred thirty-four thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •