Base | Representation |
---|---|
bin | 101111000101000001… |
… | …0011001001011001101 |
3 | 100122221211201210022002 |
4 | 1132022002121023031 |
5 | 3124023113143041 |
6 | 114240022402045 |
7 | 10206232635401 |
oct | 1361202311315 |
9 | 318854653262 |
10 | 101100131021 |
11 | 3997042a89a |
12 | 17716290325 |
13 | 96c2707c46 |
14 | 4c711d5101 |
15 | 296aae959b |
hex | 178a0992cd |
101100131021 has 2 divisors, whose sum is σ = 101100131022. Its totient is φ = 101100131020.
The previous prime is 101100130951. The next prime is 101100131141. The reversal of 101100131021 is 120131001101.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 100070362921 + 1029768100 = 316339^2 + 32090^2 .
It is a cyclic number.
It is not a de Polignac number, because 101100131021 - 210 = 101100129997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101100130993 and 101100131011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101100133021) 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, 50550065510 + 50550065511.
It is an arithmetic number, because the mean of its divisors is an integer number (50550065511).
Almost surely, 2101100131021 is an apocalyptic number.
It is an amenable number.
101100131021 is a deficient number, since it is larger than the sum of its proper divisors (1).
101100131021 is an equidigital number, since it uses as much as digits as its factorization.
101100131021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 101100131021 its reverse (120131001101), we get a palindrome (221231132122).
The spelling of 101100131021 in words is "one hundred one billion, one hundred million, one hundred thirty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •