Base | Representation |
---|---|
bin | 10100110010111110100… |
… | …11110110110110001001 |
3 | 2112022102011111112200111 |
4 | 22121133103312312021 |
5 | 43201411241041131 |
6 | 1304133242034321 |
7 | 102424360325566 |
oct | 12313723666611 |
9 | 2468364445614 |
10 | 714563612041 |
11 | 256054591a04 |
12 | b65a1aa89a1 |
13 | 524c9773c66 |
14 | 268295b186d |
15 | 138c291bab1 |
hex | a65f4f6d89 |
714563612041 has 2 divisors, whose sum is σ = 714563612042. Its totient is φ = 714563612040.
The previous prime is 714563612003. The next prime is 714563612053. The reversal of 714563612041 is 140216365417.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 485117822016 + 229445790025 = 696504^2 + 479005^2 .
It is a cyclic number.
It is not a de Polignac number, because 714563612041 - 233 = 705973677449 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 714563611985 and 714563612003.
It is not a weakly prime, because it can be changed into another prime (714563612141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 357281806020 + 357281806021.
It is an arithmetic number, because the mean of its divisors is an integer number (357281806021).
Almost surely, 2714563612041 is an apocalyptic number.
It is an amenable number.
714563612041 is a deficient number, since it is larger than the sum of its proper divisors (1).
714563612041 is an equidigital number, since it uses as much as digits as its factorization.
714563612041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120960, while the sum is 40.
Adding to 714563612041 its reverse (140216365417), we get a palindrome (854779977458).
The spelling of 714563612041 in words is "seven hundred fourteen billion, five hundred sixty-three million, six hundred twelve thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •