Base | Representation |
---|---|
bin | 111100010001110001… |
… | …001011110001010100 |
3 | 20012001122000112010222 |
4 | 330101301023301110 |
5 | 2030022442143010 |
6 | 45422210133512 |
7 | 4450613103443 |
oct | 742161136124 |
9 | 205048015128 |
10 | 64722615380 |
11 | 254a3257985 |
12 | 10663581298 |
13 | 6145ca8967 |
14 | 31bdb8ad5a |
15 | 1a3c166355 |
hex | f11c4bc54 |
64722615380 has 54 divisors (see below), whose sum is σ = 137149432686. Its totient is φ = 25656492096.
The previous prime is 64722615371. The next prime is 64722615389. The reversal of 64722615380 is 8351622746.
It is an interprime number because it is at equal distance from previous prime (64722615371) and next prime (64722615389).
It can be written as a sum of positive squares in 3 ways, for example, as 18568967824 + 46153647556 = 136268^2 + 214834^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (64722615389) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 185451446 + ... + 185451794.
It is an arithmetic number, because the mean of its divisors is an integer number (2539804309).
Almost surely, 264722615380 is an apocalyptic number.
It is an amenable number.
64722615380 is an abundant number, since it is smaller than the sum of its proper divisors (72426817306).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64722615380 is an equidigital number, since it uses as much as digits as its factorization.
64722615380 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1033 (or 519 counting only the distinct ones).
The product of its (nonzero) digits is 483840, while the sum is 44.
The spelling of 64722615380 in words is "sixty-four billion, seven hundred twenty-two million, six hundred fifteen thousand, three hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •