Base | Representation |
---|---|
bin | 101111111110000010… |
… | …0001011000101001000 |
3 | 100211220011111202212010 |
4 | 1133330010023011020 |
5 | 3141432334401300 |
6 | 115153522215520 |
7 | 10304522516511 |
oct | 1377404130510 |
9 | 324804452763 |
10 | 103013200200 |
11 | 3a7622a1aa9 |
12 | 17b6aab45a0 |
13 | 9938b66341 |
14 | 4db3301a08 |
15 | 2a2da39a50 |
hex | 17fc10b148 |
103013200200 has 96 divisors (see below), whose sum is σ = 319394512800. Its totient is φ = 27465576960.
The previous prime is 103013200189. The next prime is 103013200231. The reversal of 103013200200 is 2002310301.
It is a happy number.
It is a super-2 number, since 2×1030132002002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5041204 + ... + 5061596.
It is an arithmetic number, because the mean of its divisors is an integer number (3327026175).
Almost surely, 2103013200200 is an apocalyptic number.
103013200200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103013200200 is an abundant number, since it is smaller than the sum of its proper divisors (216381312600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103013200200 is a wasteful number, since it uses less digits than its factorization.
103013200200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28831 (or 28822 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 103013200200 its reverse (2002310301), we get a palindrome (105015510501).
The spelling of 103013200200 in words is "one hundred three billion, thirteen million, two hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •