Base | Representation |
---|---|
bin | 101111000010101100… |
… | …0110001100100010101 |
3 | 100122202101221000100111 |
4 | 1132011120301210111 |
5 | 3123343130041041 |
6 | 114224154243021 |
7 | 10204264532635 |
oct | 1360530614425 |
9 | 318671830314 |
10 | 101022112021 |
11 | 39930391a86 |
12 | 176b4126471 |
13 | 96ac4bc45c |
14 | 4c64ac66c5 |
15 | 2963d37981 |
hex | 1785631915 |
101022112021 has 2 divisors, whose sum is σ = 101022112022. Its totient is φ = 101022112020.
The previous prime is 101022112001. The next prime is 101022112057. The reversal of 101022112021 is 120211220101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 69675409521 + 31346702500 = 263961^2 + 177050^2 .
It is a cyclic number.
It is not a de Polignac number, because 101022112021 - 213 = 101022103829 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101022111992 and 101022112010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101022112001) 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, 50511056010 + 50511056011.
It is an arithmetic number, because the mean of its divisors is an integer number (50511056011).
Almost surely, 2101022112021 is an apocalyptic number.
It is an amenable number.
101022112021 is a deficient number, since it is larger than the sum of its proper divisors (1).
101022112021 is an equidigital number, since it uses as much as digits as its factorization.
101022112021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 101022112021 its reverse (120211220101), we get a palindrome (221233332122).
The spelling of 101022112021 in words is "one hundred one billion, twenty-two million, one hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •