Base | Representation |
---|---|
bin | 110000100101111000010101… |
… | …0001101101000111111101001 |
3 | 2002001100211022021000112222011 |
4 | 1201023300222031220333221 |
5 | 422010311420423210333 |
6 | 4113013232235555521 |
7 | 156012660116344645 |
oct | 14113605215507751 |
9 | 2061324267015864 |
10 | 427418673647593 |
11 | 114209272546181 |
12 | 3bb30728bbbba1 |
13 | 1546553c43c454 |
14 | 7779261d65c25 |
15 | 346321967e9cd |
hex | 184bc2a368fe9 |
427418673647593 has 2 divisors, whose sum is σ = 427418673647594. Its totient is φ = 427418673647592.
The previous prime is 427418673647543. The next prime is 427418673647627. The reversal of 427418673647593 is 395746376814724.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 427377394379664 + 41279267929 = 20673108^2 + 203173^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-427418673647593 is a prime.
It is a super-2 number, since 2×4274186736475932 (a number of 30 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (427418673647513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 213709336823796 + 213709336823797.
It is an arithmetic number, because the mean of its divisors is an integer number (213709336823797).
Almost surely, 2427418673647593 is an apocalyptic number.
It is an amenable number.
427418673647593 is a deficient number, since it is larger than the sum of its proper divisors (1).
427418673647593 is an equidigital number, since it uses as much as digits as its factorization.
427418673647593 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5120962560, while the sum is 76.
The spelling of 427418673647593 in words is "four hundred twenty-seven trillion, four hundred eighteen billion, six hundred seventy-three million, six hundred forty-seven thousand, five hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •