Base | Representation |
---|---|
bin | 101111111101111100… |
… | …0110011100001000100 |
3 | 100211212221220100221001 |
4 | 1133323320303201010 |
5 | 3141431104020400 |
6 | 115153334303044 |
7 | 10304455265254 |
oct | 1377370634104 |
9 | 324787810831 |
10 | 103010220100 |
11 | 3a760647007 |
12 | 17b69ab7a84 |
13 | 9938361a78 |
14 | 4db2b67964 |
15 | 2a2d64ba6a |
hex | 17fbe33844 |
103010220100 has 36 divisors (see below), whose sum is σ = 223546630468. Its totient is φ = 41201424000.
The previous prime is 103010220043. The next prime is 103010220101. The reversal of 103010220100 is 1022010301.
It can be written as a sum of positive squares in 6 ways, for example, as 55350090756 + 47660129344 = 235266^2 + 218312^2 .
It is a super-2 number, since 2×1030102201002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (103010220101) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2421010 + ... + 2463190.
Almost surely, 2103010220100 is an apocalyptic number.
103010220100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103010220100 is an abundant number, since it is smaller than the sum of its proper divisors (120536410368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103010220100 is a wasteful number, since it uses less digits than its factorization.
103010220100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66616 (or 66609 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 103010220100 its reverse (1022010301), we get a palindrome (104032230401).
The spelling of 103010220100 in words is "one hundred three billion, ten million, two hundred twenty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •