Base | Representation |
---|---|
bin | 10001011110100111110… |
… | …111000101100001101001 |
3 | 11020211021120100012202111 |
4 | 101132213313011201221 |
5 | 124134334200024314 |
6 | 2315441105002321 |
7 | 152530451330533 |
oct | 21364767054151 |
9 | 4224246305674 |
10 | 1201112111209 |
11 | 42343052376a |
12 | 17494a0233a1 |
13 | 89358b1918a |
14 | 421c40da853 |
15 | 2139c664ec4 |
hex | 117a7dc5869 |
1201112111209 has 2 divisors, whose sum is σ = 1201112111210. Its totient is φ = 1201112111208.
The previous prime is 1201112111191. The next prime is 1201112111231. The reversal of 1201112111209 is 9021112111021.
It is a happy number.
It is an a-pointer prime, because the next prime (1201112111231) can be obtained adding 1201112111209 to its sum of digits (22).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 993839517225 + 207272593984 = 996915^2 + 455272^2 .
It is a cyclic number.
It is not a de Polignac number, because 1201112111209 - 29 = 1201112110697 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1201112111209.
It is not a weakly prime, because it can be changed into another prime (1201112111249) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 600556055604 + 600556055605.
It is an arithmetic number, because the mean of its divisors is an integer number (600556055605).
Almost surely, 21201112111209 is an apocalyptic number.
It is an amenable number.
1201112111209 is a deficient number, since it is larger than the sum of its proper divisors (1).
1201112111209 is an equidigital number, since it uses as much as digits as its factorization.
1201112111209 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 22.
The spelling of 1201112111209 in words is "one trillion, two hundred one billion, one hundred twelve million, one hundred eleven thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •