Base | Representation |
---|---|
bin | 11001001101001011… |
… | …110111001011011000 |
3 | 2120212012010012200111 |
4 | 121031023313023120 |
5 | 420412034242000 |
6 | 20233335414104 |
7 | 1645455440626 |
oct | 311513671330 |
9 | 76765105614 |
10 | 27064759000 |
11 | 10529395024 |
12 | 52b3b24334 |
13 | 27242359c6 |
14 | 144a69c516 |
15 | a860c7cba |
hex | 64d2f72d8 |
27064759000 has 256 divisors, whose sum is σ = 68974963200. Its totient is φ = 9906624000.
The previous prime is 27064758997. The next prime is 27064759049. The reversal of 27064759000 is 95746072.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a congruent number.
It is an unprimeable number.
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 in 63 ways as a sum of consecutive naturals, for example, 128268895 + ... + 128269105.
It is an arithmetic number, because the mean of its divisors is an integer number (269433450).
Almost surely, 227064759000 is an apocalyptic number.
27064759000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 27064759000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (34487481600).
27064759000 is an abundant number, since it is smaller than the sum of its proper divisors (41910204200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27064759000 is a wasteful number, since it uses less digits than its factorization.
27064759000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 451 (or 437 counting only the distinct ones).
The product of its (nonzero) digits is 105840, while the sum is 40.
The spelling of 27064759000 in words is "twenty-seven billion, sixty-four million, seven hundred fifty-nine thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •