Base | Representation |
---|---|
bin | 100100000101110… |
… | …1001011111111001 |
3 | 10010101201211200112 |
4 | 1020023221133321 |
5 | 4440004404423 |
6 | 320100114105 |
7 | 42003304322 |
oct | 11013513771 |
9 | 3111654615 |
10 | 1211013113 |
11 | 571649092 |
12 | 299695935 |
13 | 163b7c20b |
14 | b6b99449 |
15 | 714b3a78 |
hex | 482e97f9 |
1211013113 has 2 divisors, whose sum is σ = 1211013114. Its totient is φ = 1211013112.
The previous prime is 1211013103. The next prime is 1211013131. The reversal of 1211013113 is 3113101121.
It is a happy number.
Together with next prime (1211013131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1208813824 + 2199289 = 34768^2 + 1483^2 .
It is a cyclic number.
It is not a de Polignac number, because 1211013113 - 26 = 1211013049 is a prime.
It is not a weakly prime, because it can be changed into another prime (1211013103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 605506556 + 605506557.
It is an arithmetic number, because the mean of its divisors is an integer number (605506557).
Almost surely, 21211013113 is an apocalyptic number.
It is an amenable number.
1211013113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1211013113 is an equidigital number, since it uses as much as digits as its factorization.
1211013113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 14.
The square root of 1211013113 is about 34799.6136903846. The cubic root of 1211013113 is about 1065.8995575147.
Adding to 1211013113 its reverse (3113101121), we get a palindrome (4324114234).
The spelling of 1211013113 in words is "one billion, two hundred eleven million, thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •