Base | Representation |
---|---|
bin | 10110111110000100001011… |
… | …101001100101011110110101 |
3 | 111020200121202022201100211222 |
4 | 112332010023221211132311 |
5 | 101220121301013020041 |
6 | 554504531035440125 |
7 | 30164415224152151 |
oct | 2676041351453665 |
9 | 436617668640758 |
10 | 101022121220021 |
11 | 2a209271873091 |
12 | b3b691bbb6045 |
13 | 444a4643c6a91 |
14 | 1ad36d5152061 |
15 | ba2c3d10b74b |
hex | 5be10ba657b5 |
101022121220021 has 2 divisors, whose sum is σ = 101022121220022. Its totient is φ = 101022121220020.
The previous prime is 101022121219963. The next prime is 101022121220051. The reversal of 101022121220021 is 120022121220101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 89276325418225 + 11745795801796 = 9448615^2 + 3427214^2 .
It is a cyclic number.
It is not a de Polignac number, because 101022121220021 - 226 = 101022054111157 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101022121220051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50511060610010 + 50511060610011.
It is an arithmetic number, because the mean of its divisors is an integer number (50511060610011).
Almost surely, 2101022121220021 is an apocalyptic number.
It is an amenable number.
101022121220021 is a deficient number, since it is larger than the sum of its proper divisors (1).
101022121220021 is an equidigital number, since it uses as much as digits as its factorization.
101022121220021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 101022121220021 its reverse (120022121220101), we get a palindrome (221044242440122).
The spelling of 101022121220021 in words is "one hundred one trillion, twenty-two billion, one hundred twenty-one million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •