Base | Representation |
---|---|
bin | 10001100111110101010… |
… | …110110100111100010001 |
3 | 11021202210211022101122222 |
4 | 101213311112310330101 |
5 | 124320113031241423 |
6 | 2324154324110425 |
7 | 153330522651131 |
oct | 21476526647421 |
9 | 4252724271588 |
10 | 1211002212113 |
11 | 4276461a5981 |
12 | 17684a235415 |
13 | 8a273b081a5 |
14 | 42881812ac1 |
15 | 2177aa653c8 |
hex | 119f55b4f11 |
1211002212113 has 2 divisors, whose sum is σ = 1211002212114. Its totient is φ = 1211002212112.
The previous prime is 1211002212109. The next prime is 1211002212163. The reversal of 1211002212113 is 3112122001121.
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., 705149831824 + 505852380289 = 839732^2 + 711233^2 .
It is a cyclic number.
It is not a de Polignac number, because 1211002212113 - 22 = 1211002212109 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1211002212091 and 1211002212100.
It is not a weakly prime, because it can be changed into another prime (1211002212163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 605501106056 + 605501106057.
It is an arithmetic number, because the mean of its divisors is an integer number (605501106057).
Almost surely, 21211002212113 is an apocalyptic number.
It is an amenable number.
1211002212113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1211002212113 is an equidigital number, since it uses as much as digits as its factorization.
1211002212113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 1211002212113 its reverse (3112122001121), we get a palindrome (4323124213234).
The spelling of 1211002212113 in words is "one trillion, two hundred eleven billion, two million, two hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •