Base | Representation |
---|---|
bin | 101111111101110100… |
… | …1111001110101001000 |
3 | 100211212200112220111021 |
4 | 1133323221321311020 |
5 | 3141424104020200 |
6 | 115153114442224 |
7 | 10304410135525 |
oct | 1377351716510 |
9 | 324780486437 |
10 | 103006313800 |
11 | 3a759419165 |
12 | 17b68733374 |
13 | 99375c4a50 |
14 | 4db242c14c |
15 | 2a2d12941a |
hex | 17fba79d48 |
103006313800 has 48 divisors (see below), whose sum is σ = 257911969140. Its totient is φ = 38033099520.
The previous prime is 103006313791. The next prime is 103006313849. The reversal of 103006313800 is 8313600301.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 7674811236 + 95331502564 = 87606^2 + 308758^2 .
It is a super-2 number, since 2×1030063138002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 19806307 + ... + 19811506.
Almost surely, 2103006313800 is an apocalyptic number.
103006313800 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103006313800 is an abundant number, since it is smaller than the sum of its proper divisors (154905655340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103006313800 is a wasteful number, since it uses less digits than its factorization.
103006313800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39617842 (or 39617833 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 25.
The spelling of 103006313800 in words is "one hundred three billion, six million, three hundred thirteen thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •