Base | Representation |
---|---|
bin | 101111000010010111… |
… | …0110011110001101101 |
3 | 100122201122020002211001 |
4 | 1132010232303301231 |
5 | 3123332321023041 |
6 | 114223122400301 |
7 | 10204102164022 |
oct | 1360456636155 |
9 | 318648202731 |
10 | 101011111021 |
11 | 39925158847 |
12 | 176b0500091 |
13 | 96aa13a0a2 |
14 | 4c63461549 |
15 | 2962db3131 |
hex | 1784bb3c6d |
101011111021 has 2 divisors, whose sum is σ = 101011111022. Its totient is φ = 101011111020.
The previous prime is 101011111001. The next prime is 101011111031. The reversal of 101011111021 is 120111110101.
It is an a-pointer prime, because the next prime (101011111031) can be obtained adding 101011111021 to its sum of digits (10).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 65170941796 + 35840169225 = 255286^2 + 189315^2 .
It is a cyclic number.
It is not a de Polignac number, because 101011111021 - 211 = 101011108973 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101011110989 and 101011111007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101011111001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50505555510 + 50505555511.
It is an arithmetic number, because the mean of its divisors is an integer number (50505555511).
Almost surely, 2101011111021 is an apocalyptic number.
It is an amenable number.
101011111021 is a deficient number, since it is larger than the sum of its proper divisors (1).
101011111021 is an equidigital number, since it uses as much as digits as its factorization.
101011111021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 101011111021 its reverse (120111110101), we get a palindrome (221122221122).
The spelling of 101011111021 in words is "one hundred one billion, eleven million, one hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •