Base | Representation |
---|---|
bin | 101011011100010… |
… | …1110001100100001 |
3 | 10202120221022222222 |
4 | 1112320232030201 |
5 | 10441133203412 |
6 | 400351440425 |
7 | 51060220652 |
oct | 12670561441 |
9 | 3676838888 |
10 | 1457709857 |
11 | 688925a9a |
12 | 348226115 |
13 | 1a3006216 |
14 | db855529 |
15 | 87e94072 |
hex | 56e2e321 |
1457709857 has 2 divisors, whose sum is σ = 1457709858. Its totient is φ = 1457709856.
The previous prime is 1457709833. The next prime is 1457709919. The reversal of 1457709857 is 7589077541.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1222271521 + 235438336 = 34961^2 + 15344^2 .
It is a cyclic number.
It is not a de Polignac number, because 1457709857 - 220 = 1456661281 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1457709799 and 1457709808.
It is not a weakly prime, because it can be changed into another prime (1457703857) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 728854928 + 728854929.
It is an arithmetic number, because the mean of its divisors is an integer number (728854929).
Almost surely, 21457709857 is an apocalyptic number.
It is an amenable number.
1457709857 is a deficient number, since it is larger than the sum of its proper divisors (1).
1457709857 is an equidigital number, since it uses as much as digits as its factorization.
1457709857 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2469600, while the sum is 53.
The square root of 1457709857 is about 38179.9666972092. The cubic root of 1457709857 is about 1133.8537223695.
The spelling of 1457709857 in words is "one billion, four hundred fifty-seven million, seven hundred nine thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •