Base | Representation |
---|---|
bin | 1001111001000010… |
… | …01110101110000100 |
3 | 111201002021202122022 |
4 | 10330201032232010 |
5 | 41333414430200 |
6 | 2234534222312 |
7 | 245410621100 |
oct | 47441165604 |
9 | 14632252568 |
10 | 5310311300 |
11 | 2285594528 |
12 | 10424b4998 |
13 | 668229b48 |
14 | 38539a900 |
15 | 211300885 |
hex | 13c84eb84 |
5310311300 has 108 divisors (see below), whose sum is σ = 13987854720. Its totient is φ = 1741481280.
The previous prime is 5310311261. The next prime is 5310311341. The reversal of 5310311300 is 31130135.
It is a super-2 number, since 2×53103113002 = 56398812205815380000, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 89141 + ... + 136259.
Almost surely, 25310311300 is an apocalyptic number.
5310311300 is a gapful number since it is divisible by the number (50) 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 5310311300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6993927360).
5310311300 is an abundant number, since it is smaller than the sum of its proper divisors (8677543420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5310311300 is a wasteful number, since it uses less digits than its factorization.
5310311300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47170 (or 47156 counting only the distinct ones).
The product of its (nonzero) digits is 135, while the sum is 17.
The square root of 5310311300 is about 72871.8827806720. The cubic root of 5310311300 is about 1744.6433536858.
Adding to 5310311300 its reverse (31130135), we get a palindrome (5341441435).
The spelling of 5310311300 in words is "five billion, three hundred ten million, three hundred eleven thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •