Base | Representation |
---|---|
bin | 1001101001100101100001… |
… | …00101101011110011110111 |
3 | 2210010121210022221212010221 |
4 | 10310302300211223303313 |
5 | 10240132231341023111 |
6 | 113044214015155211 |
7 | 4320046613242114 |
oct | 464626045536367 |
9 | 83117708855127 |
10 | 21220101111031 |
11 | 6841437963389 |
12 | 2468720b15b07 |
13 | bac07c1b8784 |
14 | 5350b626b90b |
15 | 26beb4611371 |
hex | 134cb096bcf7 |
21220101111031 has 2 divisors, whose sum is σ = 21220101111032. Its totient is φ = 21220101111030.
The previous prime is 21220101110983. The next prime is 21220101111061. The reversal of 21220101111031 is 13011110102212.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 21220101111031 - 227 = 21219966893303 is a prime.
It is a super-2 number, since 2×212201011110312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21220101110996 and 21220101111014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21220101111061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10610050555515 + 10610050555516.
It is an arithmetic number, because the mean of its divisors is an integer number (10610050555516).
Almost surely, 221220101111031 is an apocalyptic number.
21220101111031 is a deficient number, since it is larger than the sum of its proper divisors (1).
21220101111031 is an equidigital number, since it uses as much as digits as its factorization.
21220101111031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 21220101111031 its reverse (13011110102212), we get a palindrome (34231211213243).
The spelling of 21220101111031 in words is "twenty-one trillion, two hundred twenty billion, one hundred one million, one hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •