Base | Representation |
---|---|
bin | 1001011000011000111111110… |
… | …0110110010001011101011111 |
3 | 10012120100102111011112211020102 |
4 | 2112012033330312101131133 |
5 | 1143011133342122414011 |
6 | 10255554252432011315 |
7 | 256022165615521565 |
oct | 22606177466213537 |
9 | 3176312434484212 |
10 | 660136420513631 |
11 | 181381313728096 |
12 | 62056a3b690b3b |
13 | 2244679c4a0119 |
14 | b902ab7a63a35 |
15 | 514b9e35d373b |
hex | 25863fcd9175f |
660136420513631 has 2 divisors, whose sum is σ = 660136420513632. Its totient is φ = 660136420513630.
The previous prime is 660136420513561. The next prime is 660136420513657. The reversal of 660136420513631 is 136315024631066.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 660136420513631 - 210 = 660136420512607 is a prime.
It is a super-2 number, since 2×6601364205136312 (a number of 30 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (660136420513831) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 330068210256815 + 330068210256816.
It is an arithmetic number, because the mean of its divisors is an integer number (330068210256816).
Almost surely, 2660136420513631 is an apocalyptic number.
660136420513631 is a deficient number, since it is larger than the sum of its proper divisors (1).
660136420513631 is an equidigital number, since it uses as much as digits as its factorization.
660136420513631 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1399680, while the sum is 47.
The spelling of 660136420513631 in words is "six hundred sixty trillion, one hundred thirty-six billion, four hundred twenty million, five hundred thirteen thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •