Base | Representation |
---|---|
bin | 100010011001001… |
… | …0000011001000101 |
3 | 2222102111112201202 |
4 | 1010302100121011 |
5 | 4330412300104 |
6 | 310302432245 |
7 | 40412023313 |
oct | 10462203105 |
9 | 2872445652 |
10 | 1154025029 |
11 | 5424650a3 |
12 | 282592685 |
13 | 155118161 |
14 | ad3a30b3 |
15 | 6b4a851e |
hex | 44c90645 |
1154025029 has 2 divisors, whose sum is σ = 1154025030. Its totient is φ = 1154025028.
The previous prime is 1154025011. The next prime is 1154025031. The reversal of 1154025029 is 9205204511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1149074404 + 4950625 = 33898^2 + 2225^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1154025029 is a prime.
Together with 1154025031, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 1154024992 and 1154025010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1154022029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 577012514 + 577012515.
It is an arithmetic number, because the mean of its divisors is an integer number (577012515).
Almost surely, 21154025029 is an apocalyptic number.
It is an amenable number.
1154025029 is a deficient number, since it is larger than the sum of its proper divisors (1).
1154025029 is an equidigital number, since it uses as much as digits as its factorization.
1154025029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3600, while the sum is 29.
The square root of 1154025029 is about 33970.9438932744. The cubic root of 1154025029 is about 1048.9104431810.
The spelling of 1154025029 in words is "one billion, one hundred fifty-four million, twenty-five thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •