Base | Representation |
---|---|
bin | 11101001011001101110001… |
… | …00100010000100110000001 |
3 | 22102011100111020120202210202 |
4 | 32211212320210100212001 |
5 | 31402122040342410444 |
6 | 344241155100334545 |
7 | 16341122560511225 |
oct | 1645467044204601 |
9 | 272140436522722 |
10 | 64157023013249 |
11 | 19495927a14701 |
12 | 7242089244455 |
13 | 29a4c9ac290ca |
14 | 11bb306054785 |
15 | 763d10ea034e |
hex | 3a59b8910981 |
64157023013249 has 2 divisors, whose sum is σ = 64157023013250. Its totient is φ = 64157023013248.
The previous prime is 64157023013243. The next prime is 64157023013329. The reversal of 64157023013249 is 94231032075146.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 61458700993600 + 2698322019649 = 7839560^2 + 1642657^2 .
It is a cyclic number.
It is not a de Polignac number, because 64157023013249 - 224 = 64157006236033 is a prime.
It is a super-2 number, since 2×641570230132492 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (64157023013243) 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, 32078511506624 + 32078511506625.
It is an arithmetic number, because the mean of its divisors is an integer number (32078511506625).
Almost surely, 264157023013249 is an apocalyptic number.
It is an amenable number.
64157023013249 is a deficient number, since it is larger than the sum of its proper divisors (1).
64157023013249 is an equidigital number, since it uses as much as digits as its factorization.
64157023013249 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1088640, while the sum is 47.
The spelling of 64157023013249 in words is "sixty-four trillion, one hundred fifty-seven billion, twenty-three million, thirteen thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •