Base | Representation |
---|---|
bin | 111101001101111… |
… | …000101111100101 |
3 | 2122120120120101021 |
4 | 331031320233211 |
5 | 4100411103334 |
6 | 245525131141 |
7 | 34310533144 |
oct | 7515705745 |
9 | 2576516337 |
10 | 1027050469 |
11 | 48781a245 |
12 | 247b59ab1 |
13 | 134a1b793 |
14 | 9a58d75b |
15 | 602763b4 |
hex | 3d378be5 |
1027050469 has 2 divisors, whose sum is σ = 1027050470. Its totient is φ = 1027050468.
The previous prime is 1027050463. The next prime is 1027050523. The reversal of 1027050469 is 9640507201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 955428100 + 71622369 = 30910^2 + 8463^2 .
It is a cyclic number.
It is not a de Polignac number, because 1027050469 - 29 = 1027049957 is a prime.
It is a super-2 number, since 2×10270504692 = 2109665331746239922, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1027050463) 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, 513525234 + 513525235.
It is an arithmetic number, because the mean of its divisors is an integer number (513525235).
Almost surely, 21027050469 is an apocalyptic number.
It is an amenable number.
1027050469 is a deficient number, since it is larger than the sum of its proper divisors (1).
1027050469 is an equidigital number, since it uses as much as digits as its factorization.
1027050469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15120, while the sum is 34.
The square root of 1027050469 is about 32047.6281337637. The cubic root of 1027050469 is about 1008.9367201232.
The spelling of 1027050469 in words is "one billion, twenty-seven million, fifty thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •