Base | Representation |
---|---|
bin | 1001111110100110… |
… | …00011000101100000 |
3 | 111211100000000000000 |
4 | 10333103003011200 |
5 | 41432333102110 |
6 | 2243321300000 |
7 | 246515053650 |
oct | 47723030540 |
9 | 14740000000 |
10 | 5356925280 |
11 | 22a9932283 |
12 | 1056034600 |
13 | 674a9ac95 |
14 | 38b652360 |
15 | 21545c1c0 |
hex | 13f4c3160 |
5356925280 has 360 divisors, whose sum is σ = 21695545872. Its totient is φ = 1224440064.
The previous prime is 5356925257. The next prime is 5356925311. The reversal of 5356925280 is 825296535.
5356925280 is a `hidden beast` number, since 5 + 3 + 569 + 2 + 5 + 2 + 80 = 666.
It is a tau number, because it is divible by the number of its divisors (360).
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 765275037 + ... + 765275043.
Almost surely, 25356925280 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 5356925280, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10847772936).
5356925280 is an abundant number, since it is smaller than the sum of its proper divisors (16338620592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5356925280 is an frugal number, since it uses more digits than its factorization.
5356925280 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64 (or 17 counting only the distinct ones).
The product of its (nonzero) digits is 648000, while the sum is 45.
The square root of 5356925280 is about 73191.0191212009. The cubic root of 5356925280 is about 1749.7333231736.
The spelling of 5356925280 in words is "five billion, three hundred fifty-six million, nine hundred twenty-five thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •