Base | Representation |
---|---|
bin | 1001011000101100000000110… |
… | …0110101110110101101001001 |
3 | 10012121111122201110121000000101 |
4 | 2112023000030311312231021 |
5 | 1143032011420211311433 |
6 | 10300404321251205401 |
7 | 256054612321405135 |
oct | 22613001465665511 |
9 | 3177448643530011 |
10 | 660463106353993 |
11 | 181497915332208 |
12 | 620aa211ba6861 |
13 | 2246b532b947c7 |
14 | b914828dca3c5 |
15 | 515526396d07d |
hex | 258b00cd76b49 |
660463106353993 has 2 divisors, whose sum is σ = 660463106353994. Its totient is φ = 660463106353992.
The previous prime is 660463106353927. The next prime is 660463106354011. The reversal of 660463106353993 is 399353601364066.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 520540515037449 + 139922591316544 = 22815357^2 + 11828888^2 .
It is a cyclic number.
It is not a de Polignac number, because 660463106353993 - 29 = 660463106353481 is a prime.
It is not a weakly prime, because it can be changed into another prime (660463106356993) 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, 330231553176996 + 330231553176997.
It is an arithmetic number, because the mean of its divisors is an integer number (330231553176997).
Almost surely, 2660463106353993 is an apocalyptic number.
It is an amenable number.
660463106353993 is a deficient number, since it is larger than the sum of its proper divisors (1).
660463106353993 is an equidigital number, since it uses as much as digits as its factorization.
660463106353993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 170061120, while the sum is 64.
The spelling of 660463106353993 in words is "six hundred sixty trillion, four hundred sixty-three billion, one hundred six million, three hundred fifty-three thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •