Base | Representation |
---|---|
bin | 111100000000011000… |
… | …110110000000110001 |
3 | 20011022022100001101221 |
4 | 330000120312000301 |
5 | 2023423320202004 |
6 | 45333232225041 |
7 | 4440442436365 |
oct | 740030660061 |
9 | 204268301357 |
10 | 64431022129 |
11 | 253636a5621 |
12 | 105a199b181 |
13 | 60ca762486 |
14 | 31931652a5 |
15 | 1a21768354 |
hex | f00636031 |
64431022129 has 2 divisors, whose sum is σ = 64431022130. Its totient is φ = 64431022128.
The previous prime is 64431022127. The next prime is 64431022169. The reversal of 64431022129 is 92122013446.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 46029557025 + 18401465104 = 214545^2 + 135652^2 .
It is a cyclic number.
It is not a de Polignac number, because 64431022129 - 21 = 64431022127 is a prime.
It is a super-2 number, since 2×644310221292 (a number of 22 digits) contains 22 as substring.
Together with 64431022127, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 64431022094 and 64431022103.
It is not a weakly prime, because it can be changed into another prime (64431022121) 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, 32215511064 + 32215511065.
It is an arithmetic number, because the mean of its divisors is an integer number (32215511065).
Almost surely, 264431022129 is an apocalyptic number.
It is an amenable number.
64431022129 is a deficient number, since it is larger than the sum of its proper divisors (1).
64431022129 is an equidigital number, since it uses as much as digits as its factorization.
64431022129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20736, while the sum is 34.
The spelling of 64431022129 in words is "sixty-four billion, four hundred thirty-one million, twenty-two thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •