Base | Representation |
---|---|
bin | 101010100111000… |
… | …010000001110101 |
3 | 1211211011102010202 |
4 | 222213002001311 |
5 | 2431001444442 |
6 | 154534130245 |
7 | 23500223444 |
oct | 5247020165 |
9 | 1754142122 |
10 | 714874997 |
11 | 33758a191 |
12 | 17b4b0985 |
13 | b5149b75 |
14 | 6ad2ad5b |
15 | 42b5ec32 |
hex | 2a9c2075 |
714874997 has 2 divisors, whose sum is σ = 714874998. Its totient is φ = 714874996.
The previous prime is 714874987. The next prime is 714875003. The reversal of 714874997 is 799478417.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 525372241 + 189502756 = 22921^2 + 13766^2 .
It is an emirp because it is prime and its reverse (799478417) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 714874997 - 212 = 714870901 is a prime.
It is a super-2 number, since 2×7148749972 = 1022092522671500018, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (714874907) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 357437498 + 357437499.
It is an arithmetic number, because the mean of its divisors is an integer number (357437499).
Almost surely, 2714874997 is an apocalyptic number.
It is an amenable number.
714874997 is a deficient number, since it is larger than the sum of its proper divisors (1).
714874997 is an equidigital number, since it uses as much as digits as its factorization.
714874997 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3556224, while the sum is 56.
The square root of 714874997 is about 26737.1463884985. The cubic root of 714874997 is about 894.1492897475.
The spelling of 714874997 in words is "seven hundred fourteen million, eight hundred seventy-four thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •