Base | Representation |
---|---|
bin | 1010001001100000100010100… |
… | …0000011101001100001011011 |
3 | 10110122120022111100000210100112 |
4 | 2202120020220003221201123 |
5 | 1222101000421420022001 |
6 | 11010504200223354535 |
7 | 303265030043046242 |
oct | 24230105003514133 |
9 | 3418508440023315 |
10 | 714142064220251 |
11 | 197602a48675097 |
12 | 68119624452a4b |
13 | 248634000099a4 |
14 | c84c935d51959 |
15 | 5786719907cbb |
hex | 28982280e985b |
714142064220251 has 2 divisors, whose sum is σ = 714142064220252. Its totient is φ = 714142064220250.
The previous prime is 714142064220239. The next prime is 714142064220313. The reversal of 714142064220251 is 152022460241417.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 714142064220251 - 230 = 714140990478427 is a prime.
It is a super-2 number, since 2×7141420642202512 (a number of 31 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 714142064220199 and 714142064220208.
It is not a weakly prime, because it can be changed into another prime (714142064225251) 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, 357071032110125 + 357071032110126.
It is an arithmetic number, because the mean of its divisors is an integer number (357071032110126).
Almost surely, 2714142064220251 is an apocalyptic number.
714142064220251 is a deficient number, since it is larger than the sum of its proper divisors (1).
714142064220251 is an equidigital number, since it uses as much as digits as its factorization.
714142064220251 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 215040, while the sum is 41.
The spelling of 714142064220251 in words is "seven hundred fourteen trillion, one hundred forty-two billion, sixty-four million, two hundred twenty thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •