Base | Representation |
---|---|
bin | 101010100100010… |
… | …011111111010011 |
3 | 1211202211012021022 |
4 | 222210103333103 |
5 | 2430311142011 |
6 | 154510550055 |
7 | 23461164224 |
oct | 5244237723 |
9 | 1752735238 |
10 | 714162131 |
11 | 337142641 |
12 | 17b20832b |
13 | b4c5a557 |
14 | 6abc324b |
15 | 42a6d8db |
hex | 2a913fd3 |
714162131 has 2 divisors, whose sum is σ = 714162132. Its totient is φ = 714162130.
The previous prime is 714162037. The next prime is 714162143. The reversal of 714162131 is 131261417.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-714162131 is a prime.
It is a super-2 number, since 2×7141621312 = 1020055098708922322, which contains 22 as substring.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 714162131.
It is not a weakly prime, because it can be changed into another prime (714162161) 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, 357081065 + 357081066.
It is an arithmetic number, because the mean of its divisors is an integer number (357081066).
Almost surely, 2714162131 is an apocalyptic number.
714162131 is a deficient number, since it is larger than the sum of its proper divisors (1).
714162131 is an equidigital number, since it uses as much as digits as its factorization.
714162131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1008, while the sum is 26.
The square root of 714162131 is about 26723.8120596595. The cubic root of 714162131 is about 893.8519787396.
The spelling of 714162131 in words is "seven hundred fourteen million, one hundred sixty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.779 sec. • engine limits •