Base | Representation |
---|---|
bin | 1001110011111100… |
… | …01010111000000000 |
3 | 111121002212002020000 |
4 | 10321332022320000 |
5 | 41241444103310 |
6 | 2230410120000 |
7 | 244351400340 |
oct | 47176127000 |
9 | 14532762200 |
10 | 5267566080 |
11 | 22634493a7 |
12 | 1030120000 |
13 | 65c41190a |
14 | 37d830d20 |
15 | 20c6aa4c0 |
hex | 139f8ae00 |
5267566080 has 800 divisors, whose sum is σ = 22815682560. Its totient is φ = 1134673920.
The previous prime is 5267566049. The next prime is 5267566081. The reversal of 5267566080 is 806657625.
5267566080 is a `hidden beast` number, since 5 + 2 + 6 + 7 + 566 + 0 + 80 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5267566081) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 27578785 + ... + 27578975.
Almost surely, 25267566080 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5267566080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11407841280).
5267566080 is an abundant number, since it is smaller than the sum of its proper divisors (17548116480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5267566080 is a wasteful number, since it uses less digits than its factorization.
5267566080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 252 (or 227 counting only the distinct ones).
The product of its (nonzero) digits is 604800, while the sum is 45.
The square root of 5267566080 is about 72577.9999724434. Note that the first 4 decimals coincide. The cubic root of 5267566080 is about 1739.9495823679.
The spelling of 5267566080 in words is "five billion, two hundred sixty-seven million, five hundred sixty-six thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •