Base | Representation |
---|---|
bin | 101111110001010111000100… |
… | …111111001100111111000111 |
3 | 1000112220101101120200221221021 |
4 | 233301113010333030333013 |
5 | 210014240222322333111 |
6 | 2022502413023332011 |
7 | 62153145212646652 |
oct | 5761270477147707 |
9 | 1015811346627837 |
10 | 210100220121031 |
11 | 60a43003a58679 |
12 | 1b6929b6751007 |
13 | 903049a707666 |
14 | 39c4c95112899 |
15 | 19452c76ecd71 |
hex | bf15c4fccfc7 |
210100220121031 has 2 divisors, whose sum is σ = 210100220121032. Its totient is φ = 210100220121030.
The previous prime is 210100220120977. The next prime is 210100220121061. The reversal of 210100220121031 is 130121022001012.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 210100220121031 - 215 = 210100220088263 is a prime.
It is a super-2 number, since 2×2101002201210312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 210100220120996 and 210100220121014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (210100220121061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105050110060515 + 105050110060516.
It is an arithmetic number, because the mean of its divisors is an integer number (105050110060516).
Almost surely, 2210100220121031 is an apocalyptic number.
210100220121031 is a deficient number, since it is larger than the sum of its proper divisors (1).
210100220121031 is an equidigital number, since it uses as much as digits as its factorization.
210100220121031 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 16.
Adding to 210100220121031 its reverse (130121022001012), we get a palindrome (340221242122043).
The spelling of 210100220121031 in words is "two hundred ten trillion, one hundred billion, two hundred twenty million, one hundred twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •