Base | Representation |
---|---|
bin | 1001100110101101001001… |
… | …11111001001011011001001 |
3 | 2202210011022022200210110012 |
4 | 10303112210333021123021 |
5 | 10232022024241232104 |
6 | 112530524250001305 |
7 | 4306644045416024 |
oct | 463264477113311 |
9 | 82704268623405 |
10 | 21121122211529 |
11 | 680346595319a |
12 | 24514b9116235 |
13 | ba29370c3512 |
14 | 5303a6a8c1bb |
15 | 26961ed74d6e |
hex | 1335a4fc96c9 |
21121122211529 has 2 divisors, whose sum is σ = 21121122211530. Its totient is φ = 21121122211528.
The previous prime is 21121122211517. The next prime is 21121122211537. The reversal of 21121122211529 is 92511222112112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14094408079504 + 7026714132025 = 3754252^2 + 2650795^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21121122211529 is a prime.
It is a super-2 number, since 2×211211222115292 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21121122211495 and 21121122211504.
It is not a weakly prime, because it can be changed into another prime (21121122211549) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10560561105764 + 10560561105765.
It is an arithmetic number, because the mean of its divisors is an integer number (10560561105765).
Almost surely, 221121122211529 is an apocalyptic number.
It is an amenable number.
21121122211529 is a deficient number, since it is larger than the sum of its proper divisors (1).
21121122211529 is an equidigital number, since it uses as much as digits as its factorization.
21121122211529 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2880, while the sum is 32.
The spelling of 21121122211529 in words is "twenty-one trillion, one hundred twenty-one billion, one hundred twenty-two million, two hundred eleven thousand, five hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •