Base | Representation |
---|---|
bin | 100000110100010… |
… | …1111101011110000 |
3 | 2211202002202120100 |
4 | 1001220233223300 |
5 | 4223401400422 |
6 | 301134312400 |
7 | 36201021645 |
oct | 10150575360 |
9 | 2752082510 |
10 | 1101200112 |
11 | 515664a41 |
12 | 268958700 |
13 | 1471b0ccc |
14 | a6371dcc |
15 | 66a217ac |
hex | 41a2faf0 |
1101200112 has 30 divisors (see below), whose sum is σ = 3081831272. Its totient is φ = 367066656.
The previous prime is 1101200101. The next prime is 1101200123. The reversal of 1101200112 is 2110021011.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1101200101) and next prime (1101200123).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1101200094 and 1101200103.
It is a congruent number.
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, 3823468 + ... + 3823755.
Almost surely, 21101200112 is an apocalyptic number.
1101200112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1101200112 is an abundant number, since it is smaller than the sum of its proper divisors (1980631160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101200112 is a wasteful number, since it uses less digits than its factorization.
1101200112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7647237 (or 7647228 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
The square root of 1101200112 is about 33184.3353406393. The cubic root of 1101200112 is about 1032.6553886361.
Adding to 1101200112 its reverse (2110021011), we get a palindrome (3211221123).
The spelling of 1101200112 in words is "one billion, one hundred one million, two hundred thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •