Base | Representation |
---|---|
bin | 101111000010000010… |
… | …0110101111111000101 |
3 | 100122200212112012021121 |
4 | 1132010010311333011 |
5 | 3123322012010041 |
6 | 114222050513541 |
7 | 10203606525106 |
oct | 1360404657705 |
9 | 318625465247 |
10 | 101000110021 |
11 | 39919a24608 |
12 | 176a88958b1 |
13 | 96a7a87a15 |
14 | 4c61bda3ad |
15 | 2961e3d7d1 |
hex | 1784135fc5 |
101000110021 has 2 divisors, whose sum is σ = 101000110022. Its totient is φ = 101000110020.
The previous prime is 101000110019. The next prime is 101000110061. The reversal of 101000110021 is 120011000101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 96000205921 + 4999904100 = 309839^2 + 70710^2 .
It is a cyclic number.
It is not a de Polignac number, because 101000110021 - 21 = 101000110019 is a prime.
Together with 101000110019, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 101000109986 and 101000110013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101000110061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50500055010 + 50500055011.
It is an arithmetic number, because the mean of its divisors is an integer number (50500055011).
Almost surely, 2101000110021 is an apocalyptic number.
It is an amenable number.
101000110021 is a deficient number, since it is larger than the sum of its proper divisors (1).
101000110021 is an equidigital number, since it uses as much as digits as its factorization.
101000110021 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 7.
Adding to 101000110021 its reverse (120011000101), we get a palindrome (221011110122).
The spelling of 101000110021 in words is "one hundred one billion, one hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •