Base | Representation |
---|---|
bin | 10000001001110010011… |
… | …010000100110000001000 |
3 | 10221010011021100022201022 |
4 | 100021302122010300020 |
5 | 121141310334001300 |
6 | 2205534150212012 |
7 | 143124232552400 |
oct | 20116232046010 |
9 | 3833137308638 |
10 | 1110021000200 |
11 | 398836a09842 |
12 | 15b167954008 |
13 | 8089cc391a8 |
14 | 3ba22335800 |
15 | 1dd1a60b285 |
hex | 10272684c08 |
1110021000200 has 72 divisors (see below), whose sum is σ = 3002153762250. Its totient is φ = 380578625280.
The previous prime is 1110021000113. The next prime is 1110021000211. The reversal of 1110021000200 is 20001200111.
It can be written as a sum of positive squares in 3 ways, for example, as 434826823396 + 675194176804 = 659414^2 + 821702^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 (13) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 56623925 + ... + 56643524.
Almost surely, 21110021000200 is an apocalyptic number.
1110021000200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1110021000200 is an abundant number, since it is smaller than the sum of its proper divisors (1892132762050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1110021000200 is a wasteful number, since it uses less digits than its factorization.
1110021000200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113267479 (or 113267463 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 1110021000200 its reverse (20001200111), we get a palindrome (1130022200311).
The spelling of 1110021000200 in words is "one trillion, one hundred ten billion, twenty-one million, two hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •