Base | Representation |
---|---|
bin | 101011110001110… |
… | …1001010101100101 |
3 | 10210101010000020112 |
4 | 1113203221111211 |
5 | 11002023242044 |
6 | 401432542405 |
7 | 51254654324 |
oct | 12743512545 |
9 | 3711100215 |
10 | 1468962149 |
11 | 694211006 |
12 | 34bb51a05 |
13 | 1a5445a95 |
14 | dd1440bb |
15 | 88e6809e |
hex | 578e9565 |
1468962149 has 2 divisors, whose sum is σ = 1468962150. Its totient is φ = 1468962148.
The previous prime is 1468962127. The next prime is 1468962191. The reversal of 1468962149 is 9412698641.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1460004100 + 8958049 = 38210^2 + 2993^2 .
It is a cyclic number.
It is not a de Polignac number, because 1468962149 - 216 = 1468896613 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1468962097 and 1468962106.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1468962119) 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, 734481074 + 734481075.
It is an arithmetic number, because the mean of its divisors is an integer number (734481075).
Almost surely, 21468962149 is an apocalyptic number.
It is an amenable number.
1468962149 is a deficient number, since it is larger than the sum of its proper divisors (1).
1468962149 is an equidigital number, since it uses as much as digits as its factorization.
1468962149 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 746496, while the sum is 50.
The square root of 1468962149 is about 38327.0420069173. The cubic root of 1468962149 is about 1136.7637127673.
The spelling of 1468962149 in words is "one billion, four hundred sixty-eight million, nine hundred sixty-two thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •