Base | Representation |
---|---|
bin | 101111000101000011… |
… | …0111110001001001101 |
3 | 100122221220222202101112 |
4 | 1132022012332021031 |
5 | 3124023420043041 |
6 | 114240104221405 |
7 | 10206246064055 |
oct | 1361206761115 |
9 | 318856882345 |
10 | 101101331021 |
11 | 3997107a429 |
12 | 1771676a865 |
13 | 96c2a381c2 |
14 | 4c71428565 |
15 | 296ac84deb |
hex | 178a1be24d |
101101331021 has 2 divisors, whose sum is σ = 101101331022. Its totient is φ = 101101331020.
The previous prime is 101101330927. The next prime is 101101331033. The reversal of 101101331021 is 120133101101.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 95889934921 + 5211396100 = 309661^2 + 72190^2 .
It is a cyclic number.
It is not a de Polignac number, because 101101331021 - 210 = 101101329997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101101330987 and 101101331005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101101331041) 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, 50550665510 + 50550665511.
It is an arithmetic number, because the mean of its divisors is an integer number (50550665511).
Almost surely, 2101101331021 is an apocalyptic number.
It is an amenable number.
101101331021 is a deficient number, since it is larger than the sum of its proper divisors (1).
101101331021 is an equidigital number, since it uses as much as digits as its factorization.
101101331021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 101101331021 its reverse (120133101101), we get a palindrome (221234432122).
The spelling of 101101331021 in words is "one hundred one billion, one hundred one million, three hundred thirty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •