Base | Representation |
---|---|
bin | 110000000001101011000000… |
… | …011100010011110001101101 |
3 | 1000200212112122202000100210022 |
4 | 300001223000130103301231 |
5 | 210141121333331013242 |
6 | 2025121351523251525 |
7 | 62330136341344352 |
oct | 6001530034236155 |
9 | 1020775582010708 |
10 | 211221130329197 |
11 | 6133541860253a |
12 | 1b8340a1219ba5 |
13 | 90b20b4619471 |
14 | 3a2322b718629 |
15 | 196452dcb10d2 |
hex | c01ac0713c6d |
211221130329197 has 2 divisors, whose sum is σ = 211221130329198. Its totient is φ = 211221130329196.
The previous prime is 211221130329101. The next prime is 211221130329233. The reversal of 211221130329197 is 791923031122112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 126489363069001 + 84731767260196 = 11246749^2 + 9204986^2 .
It is a cyclic number.
It is not a de Polignac number, because 211221130329197 - 28 = 211221130328941 is a prime.
It is a super-2 number, since 2×2112211303291972 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211221130323197) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105610565164598 + 105610565164599.
It is an arithmetic number, because the mean of its divisors is an integer number (105610565164599).
Almost surely, 2211221130329197 is an apocalyptic number.
It is an amenable number.
211221130329197 is a deficient number, since it is larger than the sum of its proper divisors (1).
211221130329197 is an equidigital number, since it uses as much as digits as its factorization.
211221130329197 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 81648, while the sum is 44.
The spelling of 211221130329197 in words is "two hundred eleven trillion, two hundred twenty-one billion, one hundred thirty million, three hundred twenty-nine thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •