Base | Representation |
---|---|
bin | 10011001101001101… |
… | …00000000010000100 |
3 | 222121121112110222020 |
4 | 21212212200002010 |
5 | 132104143201200 |
6 | 4423103003140 |
7 | 513344426514 |
oct | 114646400204 |
9 | 28547473866 |
10 | 10311303300 |
11 | 4411509871 |
12 | 1bb92994b0 |
13 | c843450cc |
14 | 6db639844 |
15 | 4053a0ea0 |
hex | 2669a0084 |
10311303300 has 72 divisors (see below), whose sum is σ = 29846798016. Its totient is φ = 2748504960.
The previous prime is 10311303281. The next prime is 10311303319. The reversal of 10311303300 is 330311301.
It is an interprime number because it is at equal distance from previous prime (10311303281) and next prime (10311303319).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 10311303300.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 869209 + ... + 880991.
Almost surely, 210311303300 is an apocalyptic number.
10311303300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10311303300 is an abundant number, since it is smaller than the sum of its proper divisors (19535494716).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10311303300 is a wasteful number, since it uses less digits than its factorization.
10311303300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14717 (or 14710 counting only the distinct ones).
The product of its (nonzero) digits is 81, while the sum is 15.
Adding to 10311303300 its reverse (330311301), we get a palindrome (10641614601).
The spelling of 10311303300 in words is "ten billion, three hundred eleven million, three hundred three thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •