Base | Representation |
---|---|
bin | 101001011101111… |
… | …1101001111100001 |
3 | 10120222020221021021 |
4 | 1102323331033201 |
5 | 10322202332212 |
6 | 350023325441 |
7 | 46324056535 |
oct | 12273751741 |
9 | 3528227237 |
10 | 1391449057 |
11 | 6544892a9 |
12 | 329bb0881 |
13 | 19237664b |
14 | d2b27bc5 |
15 | 82256307 |
hex | 52efd3e1 |
1391449057 has 2 divisors, whose sum is σ = 1391449058. Its totient is φ = 1391449056.
The previous prime is 1391449039. The next prime is 1391449063. The reversal of 1391449057 is 7509441931.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 780420096 + 611028961 = 27936^2 + 24719^2 .
It is an emirp because it is prime and its reverse (7509441931) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1391449057 - 227 = 1257231329 is a prime.
It is a super-2 number, since 2×13914490572 = 3872260956452378498, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1391449027) 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, 695724528 + 695724529.
It is an arithmetic number, because the mean of its divisors is an integer number (695724529).
Almost surely, 21391449057 is an apocalyptic number.
It is an amenable number.
1391449057 is a deficient number, since it is larger than the sum of its proper divisors (1).
1391449057 is an equidigital number, since it uses as much as digits as its factorization.
1391449057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 136080, while the sum is 43.
The square root of 1391449057 is about 37302.1320704326. The cubic root of 1391449057 is about 1116.4067070315.
The spelling of 1391449057 in words is "one billion, three hundred ninety-one million, four hundred forty-nine thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •