Base | Representation |
---|---|
bin | 101101000111001101000… |
… | …101001111000101011000 |
3 | 101222100221010220000102220 |
4 | 231013031011033011120 |
5 | 401243012200402300 |
6 | 10332101041424040 |
7 | 436655445153342 |
oct | 55071505170530 |
9 | 11870833800386 |
10 | 3100112122200 |
11 | a95828522955 |
12 | 4209a533b020 |
13 | 196454638932 |
14 | aa090bc2292 |
15 | 55993729da0 |
hex | 2d1cd14f158 |
3100112122200 has 192 divisors, whose sum is σ = 10342478351520. Its totient is φ = 765312000000.
The previous prime is 3100112122147. The next prime is 3100112122213. The reversal of 3100112122200 is 22212110013.
It is a super-2 number, since 2×31001121222002 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 3100112122200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1869051 + ... + 3113450.
Almost surely, 23100112122200 is an apocalyptic number.
3100112122200 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
3100112122200 is an abundant number, since it is smaller than the sum of its proper divisors (7242366229320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3100112122200 is a wasteful number, since it uses less digits than its factorization.
3100112122200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4982598 (or 4982589 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 3100112122200 its reverse (22212110013), we get a palindrome (3122324232213).
The spelling of 3100112122200 in words is "three trillion, one hundred billion, one hundred twelve million, one hundred twenty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •