Base | Representation |
---|---|
bin | 101011010111110… |
… | …1000011110101101 |
3 | 10202102110021112112 |
4 | 1112233220132231 |
5 | 10440030432044 |
6 | 400224413405 |
7 | 51031035203 |
oct | 12657503655 |
9 | 3672407475 |
10 | 1455327149 |
11 | 687548911 |
12 | 347477265 |
13 | 1a2680833 |
14 | db3d5073 |
15 | 87b7309e |
hex | 56be87ad |
1455327149 has 2 divisors, whose sum is σ = 1455327150. Its totient is φ = 1455327148.
The previous prime is 1455327073. The next prime is 1455327151. The reversal of 1455327149 is 9417235541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1349092900 + 106234249 = 36730^2 + 10307^2 .
It is a cyclic number.
It is not a de Polignac number, because 1455327149 - 28 = 1455326893 is a prime.
It is a super-2 number, since 2×14553271492 = 4235954221232936402, which contains 22 as substring.
Together with 1455327151, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1455387149) 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 as a sum of consecutive naturals, namely, 727663574 + 727663575.
It is an arithmetic number, because the mean of its divisors is an integer number (727663575).
Almost surely, 21455327149 is an apocalyptic number.
It is an amenable number.
1455327149 is a deficient number, since it is larger than the sum of its proper divisors (1).
1455327149 is an equidigital number, since it uses as much as digits as its factorization.
1455327149 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 151200, while the sum is 41.
The square root of 1455327149 is about 38148.7502940791. The cubic root of 1455327149 is about 1133.2356030971.
The spelling of 1455327149 in words is "one billion, four hundred fifty-five million, three hundred twenty-seven thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.902 sec. • engine limits •