Base | Representation |
---|---|
bin | 1111111010100010… |
… | …1101110000110000 |
3 | 102000201200110100210 |
4 | 3332220231300300 |
5 | 32222123223224 |
6 | 1543525344120 |
7 | 210603063261 |
oct | 37650556060 |
9 | 12021613323 |
10 | 4272086064 |
11 | 18a2532544 |
12 | 9b2868040 |
13 | 5310c7b9c |
14 | 2c753c968 |
15 | 1a00bd429 |
hex | fea2dc30 |
4272086064 has 40 divisors (see below), whose sum is σ = 11120484672. Its totient is φ = 1413156160.
The previous prime is 4272086059. The next prime is 4272086069. The reversal of 4272086064 is 4606802724.
It is an interprime number because it is at equal distance from previous prime (4272086059) and next prime (4272086069).
It is a hoax number, since the sum of its digits (39) coincides with the sum of the digits of its distinct prime factors.
It is not an unprimeable number, because it can be changed into a prime (4272086069) 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 7 ways as a sum of consecutive naturals, for example, 333414 + ... + 345989.
Almost surely, 24272086064 is an apocalyptic number.
It is an amenable number.
4272086064 is an abundant number, since it is smaller than the sum of its proper divisors (6848398608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4272086064 is a wasteful number, since it uses less digits than its factorization.
4272086064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 679545 (or 679539 counting only the distinct ones).
The product of its (nonzero) digits is 129024, while the sum is 39.
The square root of 4272086064 is about 65361.1969290649. The cubic root of 4272086064 is about 1622.6069472232.
Adding to 4272086064 its reverse (4606802724), we get a palindrome (8878888788).
The spelling of 4272086064 in words is "four billion, two hundred seventy-two million, eighty-six thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •