Base | Representation |
---|---|
bin | 100011110010111… |
… | …1000010000111001 |
3 | 10002201002211002010 |
4 | 1013211320100321 |
5 | 4424441041441 |
6 | 315104000133 |
7 | 41523166416 |
oct | 10745702071 |
9 | 3081084063 |
10 | 1201112121 |
11 | 566aa6350 |
12 | 296300049 |
13 | 161ac3741 |
14 | b573d10d |
15 | 706aa116 |
hex | 47978439 |
1201112121 has 8 divisors (see below), whose sum is σ = 1747072224. Its totient is φ = 727946720.
The previous prime is 1201112089. The next prime is 1201112131. The reversal of 1201112121 is 1212111021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1201112121 - 25 = 1201112089 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1201112097 and 1201112106.
It is not an unprimeable number, because it can be changed into a prime (1201112131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18198636 + ... + 18198701.
It is an arithmetic number, because the mean of its divisors is an integer number (218384028).
Almost surely, 21201112121 is an apocalyptic number.
1201112121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1201112121 is a deficient number, since it is larger than the sum of its proper divisors (545960103).
1201112121 is a wasteful number, since it uses less digits than its factorization.
1201112121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36397351.
The product of its (nonzero) digits is 8, while the sum is 12.
The square root of 1201112121 is about 34657.0645179305. The cubic root of 1201112121 is about 1062.9867469638.
Adding to 1201112121 its reverse (1212111021), we get a palindrome (2413223142).
The spelling of 1201112121 in words is "one billion, two hundred one million, one hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •