Base | Representation |
---|---|
bin | 101110101010100011… |
… | …1010000000100110101 |
3 | 100120122221221211102012 |
4 | 1131111013100010311 |
5 | 3120213311241041 |
6 | 114011543254005 |
7 | 10145231514305 |
oct | 1352507200465 |
9 | 316587854365 |
10 | 100212212021 |
11 | 395551aa139 |
12 | 17508a4a305 |
13 | 95b078139c |
14 | 4bc9301605 |
15 | 2917ba73eb |
hex | 17551d0135 |
100212212021 has 2 divisors, whose sum is σ = 100212212022. Its totient is φ = 100212212020.
The previous prime is 100212212011. The next prime is 100212212029. The reversal of 100212212021 is 120212212001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 65338516996 + 34873695025 = 255614^2 + 186745^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100212212021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100212211987 and 100212212005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100212212029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50106106010 + 50106106011.
It is an arithmetic number, because the mean of its divisors is an integer number (50106106011).
Almost surely, 2100212212021 is an apocalyptic number.
It is an amenable number.
100212212021 is a deficient number, since it is larger than the sum of its proper divisors (1).
100212212021 is an equidigital number, since it uses as much as digits as its factorization.
100212212021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 100212212021 its reverse (120212212001), we get a palindrome (220424424022).
The spelling of 100212212021 in words is "one hundred billion, two hundred twelve million, two hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •