Base | Representation |
---|---|
bin | 11101000110110101100… |
… | …10111100010111001000 |
3 | 10112121102220121112112200 |
4 | 32203122302330113020 |
5 | 112341202404401300 |
6 | 2043235134240200 |
7 | 132153326640156 |
oct | 16433262742710 |
9 | 3477386545480 |
10 | 1000103200200 |
11 | 356161202815 |
12 | 1419b0656060 |
13 | 7340378cb50 |
14 | 3659602c3d6 |
15 | 1b03584e200 |
hex | e8dacbc5c8 |
1000103200200 has 144 divisors (see below), whose sum is σ = 3617039992020. Its totient is φ = 246179243520.
The previous prime is 1000103200157. The next prime is 1000103200219. The reversal of 1000103200200 is 20023010001.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 110940954084 + 889162246116 = 333078^2 + 942954^2 .
It is a super-2 number, since 2×10001032002002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
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, 21346327 + ... + 21393126.
Almost surely, 21000103200200 is an apocalyptic number.
1000103200200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1000103200200 is an abundant number, since it is smaller than the sum of its proper divisors (2616936791820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1000103200200 is a wasteful number, since it uses less digits than its factorization.
1000103200200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42739488 (or 42739476 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
Adding to 1000103200200 its reverse (20023010001), we get a palindrome (1020126210201).
The spelling of 1000103200200 in words is "one trillion, one hundred three million, two hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •