Base | Representation |
---|---|
bin | 101111000101000001… |
… | …0101111011101001001 |
3 | 100122221211220102111002 |
4 | 1132022002233131021 |
5 | 3124023124103111 |
6 | 114240024344345 |
7 | 10206233465432 |
oct | 1361202573511 |
9 | 318854812432 |
10 | 101100222281 |
11 | 39970492413 |
12 | 177163150b5 |
13 | 96c273a646 |
14 | 4c7121a489 |
15 | 296ab1663b |
hex | 178a0af749 |
101100222281 has 2 divisors, whose sum is σ = 101100222282. Its totient is φ = 101100222280.
The previous prime is 101100222259. The next prime is 101100222287. The reversal of 101100222281 is 182222001101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 80519737600 + 20580484681 = 283760^2 + 143459^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101100222281 is a prime.
It is a super-2 number, since 2×1011002222812 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (101100222287) 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, 50550111140 + 50550111141.
It is an arithmetic number, because the mean of its divisors is an integer number (50550111141).
Almost surely, 2101100222281 is an apocalyptic number.
It is an amenable number.
101100222281 is a deficient number, since it is larger than the sum of its proper divisors (1).
101100222281 is an equidigital number, since it uses as much as digits as its factorization.
101100222281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 101100222281 its reverse (182222001101), we get a palindrome (283322223382).
The spelling of 101100222281 in words is "one hundred one billion, one hundred million, two hundred twenty-two thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •