Base | Representation |
---|---|
bin | 100100011001000… |
… | …1101000001110000 |
3 | 10011002202022212211 |
4 | 1020302031001300 |
5 | 10000101320422 |
6 | 321100501504 |
7 | 42155230642 |
oct | 11062150160 |
9 | 3132668784 |
10 | 1221120112 |
11 | 577321683 |
12 | 2a0b4a894 |
13 | 165caa6a4 |
14 | b826a892 |
15 | 7230d577 |
hex | 48c8d070 |
1221120112 has 10 divisors (see below), whose sum is σ = 2365920248. Its totient is φ = 610560048.
The previous prime is 1221120107. The next prime is 1221120119. The reversal of 1221120112 is 2110211221.
It is a super-2 number, since 2×12211201122 = 2982268655861785088, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1221120092 and 1221120101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1221120119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 38159988 + ... + 38160019.
Almost surely, 21221120112 is an apocalyptic number.
It is an amenable number.
1221120112 is a deficient number, since it is larger than the sum of its proper divisors (1144800136).
1221120112 is an equidigital number, since it uses as much as digits as its factorization.
1221120112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76320015 (or 76320009 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
The square root of 1221120112 is about 34944.5290710864. The cubic root of 1221120112 is about 1068.8566445934.
Adding to 1221120112 its reverse (2110211221), we get a palindrome (3331331333).
It can be divided in two parts, 12211 and 20112, that added together give a palindrome (32323).
The spelling of 1221120112 in words is "one billion, two hundred twenty-one million, one hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •