Base | Representation |
---|---|
bin | 10000010101000010011… |
… | …011100111100000001000 |
3 | 10222021100010222220102201 |
4 | 100111002123213200020 |
5 | 121341030324001300 |
6 | 2215252554405544 |
7 | 144032465062315 |
oct | 20250233474010 |
9 | 3867303886381 |
10 | 1122101000200 |
11 | 3a2975841614 |
12 | 1615794308b4 |
13 | 81a7683109b |
14 | 3c44a819d0c |
15 | 1e2c5dd066a |
hex | 105426e7808 |
1122101000200 has 24 divisors (see below), whose sum is σ = 2608884825930. Its totient is φ = 448840400000.
The previous prime is 1122101000159. The next prime is 1122101000221. The reversal of 1122101000200 is 20001012211.
It can be written as a sum of positive squares in 3 ways, for example, as 525094433956 + 597006566244 = 724634^2 + 772662^2 .
It is a super-2 number, since 2×11221010002002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2805252301 + ... + 2805252700.
Almost surely, 21122101000200 is an apocalyptic number.
1122101000200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1122101000200 is an abundant number, since it is smaller than the sum of its proper divisors (1486783825730).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1122101000200 is a wasteful number, since it uses less digits than its factorization.
1122101000200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5610505017 (or 5610505008 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 1122101000200 its reverse (20001012211), we get a palindrome (1142102012411).
The spelling of 1122101000200 in words is "one trillion, one hundred twenty-two billion, one hundred one million, two hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •