Base | Representation |
---|---|
bin | 1111011001000… |
… | …0110001100011 |
3 | 11111110210100211 |
4 | 3312100301203 |
5 | 113011244011 |
6 | 10223354551 |
7 | 1412501203 |
oct | 366206143 |
9 | 144423324 |
10 | 64556131 |
11 | 33492a82 |
12 | 19752a57 |
13 | 104b39c3 |
14 | 8806403 |
15 | 5a02b21 |
hex | 3d90c63 |
64556131 has 2 divisors, whose sum is σ = 64556132. Its totient is φ = 64556130.
The previous prime is 64556113. The next prime is 64556143. The reversal of 64556131 is 13165546.
64556131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (64556113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 64556131 - 29 = 64555619 is a prime.
It is a super-2 number, since 2×645561312 = 8334988099378322, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 64556093 and 64556102.
It is not a weakly prime, because it can be changed into another prime (64551131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 32278065 + 32278066.
It is an arithmetic number, because the mean of its divisors is an integer number (32278066).
Almost surely, 264556131 is an apocalyptic number.
64556131 is a deficient number, since it is larger than the sum of its proper divisors (1).
64556131 is an equidigital number, since it uses as much as digits as its factorization.
64556131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 10800, while the sum is 31.
The square root of 64556131 is about 8034.6830055703. The cubic root of 64556131 is about 401.1552664364.
The spelling of 64556131 in words is "sixty-four million, five hundred fifty-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •