Base | Representation |
---|---|
bin | 100011110010111… |
… | …1010011101011001 |
3 | 10002201010021102011 |
4 | 1013211322131121 |
5 | 4424441333423 |
6 | 315104105521 |
7 | 41523234553 |
oct | 10745723531 |
9 | 3081107364 |
10 | 1201121113 |
11 | 567002085 |
12 | 2963052a1 |
13 | 161ac786a |
14 | b57424d3 |
15 | 706acb0d |
hex | 4797a759 |
1201121113 has 2 divisors, whose sum is σ = 1201121114. Its totient is φ = 1201121112.
The previous prime is 1201121099. The next prime is 1201121149. The reversal of 1201121113 is 3111211021.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 919787584 + 281333529 = 30328^2 + 16773^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1201121113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1201121093 and 1201121102.
It is not a weakly prime, because it can be changed into another prime (1201121513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 600560556 + 600560557.
It is an arithmetic number, because the mean of its divisors is an integer number (600560557).
Almost surely, 21201121113 is an apocalyptic number.
It is an amenable number.
1201121113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1201121113 is an equidigital number, since it uses as much as digits as its factorization.
1201121113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 13.
The square root of 1201121113 is about 34657.1942459282. The cubic root of 1201121113 is about 1062.9893996035.
Adding to 1201121113 its reverse (3111211021), we get a palindrome (4312332134).
It can be divided in two parts, 12011 and 21113, that added together give a square (33124 = 1822).
The spelling of 1201121113 in words is "one billion, two hundred one million, one hundred twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •