Base | Representation |
---|---|
bin | 1001110111111000… |
… | …11010101000000000 |
3 | 111200102010110120000 |
4 | 10323330122220000 |
5 | 41323432120421 |
6 | 2233551320000 |
7 | 245232605250 |
oct | 47374325000 |
9 | 14612113500 |
10 | 5300660736 |
11 | 22800a2958 |
12 | 103b220000 |
13 | 66622b357 |
14 | 383da7960 |
15 | 210546226 |
hex | 13bf1aa00 |
5300660736 has 600 divisors, whose sum is σ = 19666643040. Its totient is φ = 1388482560.
The previous prime is 5300660693. The next prime is 5300660747. The reversal of 5300660736 is 6370660035.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 5300660736.
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, 170989041 + ... + 170989071.
Almost surely, 25300660736 is an apocalyptic number.
5300660736 is a gapful number since it is divisible by the number (56) 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 5300660736, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9833321520).
5300660736 is an abundant number, since it is smaller than the sum of its proper divisors (14365982304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5300660736 is an equidigital number, since it uses as much as digits as its factorization.
5300660736 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118 (or 62 counting only the distinct ones).
The product of its (nonzero) digits is 68040, while the sum is 36.
The square root of 5300660736 is about 72805.6367048596. The cubic root of 5300660736 is about 1743.5858512149.
The spelling of 5300660736 in words is "five billion, three hundred million, six hundred sixty thousand, seven hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •