Base | Representation |
---|---|
bin | 11101001000101100011… |
… | …01111001000010001000 |
3 | 10112201000101111022200122 |
4 | 32210112031321002020 |
5 | 112400223112321300 |
6 | 2043522105522412 |
7 | 132220123422365 |
oct | 16442615710210 |
9 | 3481011438618 |
10 | 1001100120200 |
11 | 356622a12544 |
12 | 14202a4a3408 |
13 | 7353218c13b |
14 | 3664c5b746c |
15 | 1b093122c85 |
hex | e916379088 |
1001100120200 has 48 divisors (see below), whose sum is σ = 2407818406500. Its totient is φ = 386631768320.
The previous prime is 1001100120109. The next prime is 1001100120211. The reversal of 1001100120200 is 20210011001.
It can be written as a sum of positive squares in 6 ways, for example, as 308040540196 + 693059580004 = 555014^2 + 832502^2 .
It is a Harshad number since it is a multiple of its sum of digits (8).
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 11 ways as a sum of consecutive naturals, for example, 86295935 + ... + 86307534.
Almost surely, 21001100120200 is an apocalyptic number.
1001100120200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1001100120200 is an abundant number, since it is smaller than the sum of its proper divisors (1406718286300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1001100120200 is a wasteful number, since it uses less digits than its factorization.
1001100120200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 172603514 (or 172603505 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 1001100120200 its reverse (20210011001), we get a palindrome (1021310131201).
The spelling of 1001100120200 in words is "one trillion, one billion, one hundred million, one hundred twenty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •