Base | Representation |
---|---|
bin | 10110000110010110… |
… | …10010101111010001 |
3 | 1010121212001121111222 |
4 | 23003023102233101 |
5 | 143244244431144 |
6 | 5241144214425 |
7 | 600004115132 |
oct | 130313225721 |
9 | 33555047458 |
10 | 11864452049 |
11 | 50391a047a |
12 | 237146a415 |
13 | 1171055a38 |
14 | 807a15c89 |
15 | 4968e82ee |
hex | 2c32d2bd1 |
11864452049 has 2 divisors, whose sum is σ = 11864452050. Its totient is φ = 11864452048.
The previous prime is 11864452037. The next prime is 11864452051. The reversal of 11864452049 is 94025446811.
11864452049 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7837915024 + 4026537025 = 88532^2 + 63455^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11864452049 is a prime.
It is a Sophie Germain prime.
Together with 11864452051, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (11864452009) 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, 5932226024 + 5932226025.
It is an arithmetic number, because the mean of its divisors is an integer number (5932226025).
Almost surely, 211864452049 is an apocalyptic number.
It is an amenable number.
11864452049 is a deficient number, since it is larger than the sum of its proper divisors (1).
11864452049 is an equidigital number, since it uses as much as digits as its factorization.
11864452049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 276480, while the sum is 44.
The spelling of 11864452049 in words is "eleven billion, eight hundred sixty-four million, four hundred fifty-two thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •