Base | Representation |
---|---|
bin | 110100110100000000111000… |
… | …1011000110001100010100001 |
3 | 2020220211010022011020200021102 |
4 | 1221220001301120301202201 |
5 | 441342103304123231022 |
6 | 4324001141512004145 |
7 | 166564211106346106 |
oct | 15150016130614241 |
9 | 2226733264220242 |
10 | 464545565055137 |
11 | 125022738883125 |
12 | 44128061990655 |
13 | 16c295c7035807 |
14 | 82a01a7c20aad |
15 | 38a8d69b26a92 |
hex | 1a680716318a1 |
464545565055137 has 2 divisors, whose sum is σ = 464545565055138. Its totient is φ = 464545565055136.
The previous prime is 464545565055119. The next prime is 464545565055149. The reversal of 464545565055137 is 731550565545464.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 462370364834401 + 2175200220736 = 21502799^2 + 1474856^2 .
It is a cyclic number.
It is not a de Polignac number, because 464545565055137 - 212 = 464545565051041 is a prime.
It is not a weakly prime, because it can be changed into another prime (464545565055107) 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, 232272782527568 + 232272782527569.
It is an arithmetic number, because the mean of its divisors is an integer number (232272782527569).
Almost surely, 2464545565055137 is an apocalyptic number.
It is an amenable number.
464545565055137 is a deficient number, since it is larger than the sum of its proper divisors (1).
464545565055137 is an equidigital number, since it uses as much as digits as its factorization.
464545565055137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 756000000, while the sum is 65.
The spelling of 464545565055137 in words is "four hundred sixty-four trillion, five hundred forty-five billion, five hundred sixty-five million, fifty-five thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •