Base | Representation |
---|---|
bin | 101111000101101011… |
… | …1000000010001110001 |
3 | 100200000101110122220012 |
4 | 1132023113000101301 |
5 | 3124044302430111 |
6 | 114242134024305 |
7 | 10206622315025 |
oct | 1361327002161 |
9 | 320011418805 |
10 | 101122311281 |
11 | 399819aa192 |
12 | 177217a8095 |
13 | 96c71a2864 |
14 | 4c7412a385 |
15 | 296ca2b48b |
hex | 178b5c0471 |
101122311281 has 2 divisors, whose sum is σ = 101122311282. Its totient is φ = 101122311280.
The previous prime is 101122311259. The next prime is 101122311319. The reversal of 101122311281 is 182113221101.
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., 87966221281 + 13156090000 = 296591^2 + 114700^2 .
It is a cyclic number.
It is not a de Polignac number, because 101122311281 - 222 = 101118116977 is a prime.
It is a super-2 number, since 2×1011223112812 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (101122311211) 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, 50561155640 + 50561155641.
It is an arithmetic number, because the mean of its divisors is an integer number (50561155641).
Almost surely, 2101122311281 is an apocalyptic number.
It is an amenable number.
101122311281 is a deficient number, since it is larger than the sum of its proper divisors (1).
101122311281 is an equidigital number, since it uses as much as digits as its factorization.
101122311281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 23.
Adding to 101122311281 its reverse (182113221101), we get a palindrome (283235532382).
The spelling of 101122311281 in words is "one hundred one billion, one hundred twenty-two million, three hundred eleven thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •