Base | Representation |
---|---|
bin | 1001100110011100011001… |
… | …00010011111010000100101 |
3 | 2202202022002002102022120001 |
4 | 10303032030202133100211 |
5 | 10231400111230023023 |
6 | 112522435222341301 |
7 | 4306205032005643 |
oct | 463161442372045 |
9 | 82668062368501 |
10 | 21112122111013 |
11 | 67aa6675a349a |
12 | 244b806b8a831 |
13 | ba1b3160955b |
14 | 52db9164c193 |
15 | 269294b786ad |
hex | 13338c89f425 |
21112122111013 has 2 divisors, whose sum is σ = 21112122111014. Its totient is φ = 21112122111012.
The previous prime is 21112122110977. The next prime is 21112122111053. The reversal of 21112122111013 is 31011122121112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21062803472929 + 49318638084 = 4589423^2 + 222078^2 .
It is a cyclic number.
It is not a de Polignac number, because 21112122111013 - 241 = 18913098855461 is a prime.
It is a super-2 number, since 2×211121221110132 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21112122111053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10556061055506 + 10556061055507.
It is an arithmetic number, because the mean of its divisors is an integer number (10556061055507).
Almost surely, 221112122111013 is an apocalyptic number.
It is an amenable number.
21112122111013 is a deficient number, since it is larger than the sum of its proper divisors (1).
21112122111013 is an equidigital number, since it uses as much as digits as its factorization.
21112122111013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 19.
Adding to 21112122111013 its reverse (31011122121112), we get a palindrome (52123244232125).
The spelling of 21112122111013 in words is "twenty-one trillion, one hundred twelve billion, one hundred twenty-two million, one hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •