Base | Representation |
---|---|
bin | 101111000101101011… |
… | …0001111001100000011 |
3 | 100200000101002110002011 |
4 | 1132023112033030003 |
5 | 3124044230011321 |
6 | 114242125433351 |
7 | 10206620516563 |
oct | 1361326171403 |
9 | 320011073064 |
10 | 101122110211 |
11 | 39981882111 |
12 | 1772170b857 |
13 | 96c7132195 |
14 | 4c740b6da3 |
15 | 296c9dbae1 |
hex | 178b58f303 |
101122110211 has 8 divisors (see below), whose sum is σ = 101415605760. Its totient is φ = 100829028168.
The previous prime is 101122110163. The next prime is 101122110239. The reversal of 101122110211 is 112011221101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101122110211 - 217 = 101121979139 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101122110191 and 101122110200.
It is not an unprimeable number, because it can be changed into a prime (101122110281) 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 in 7 ways as a sum of consecutive naturals, for example, 389830 + ... + 595156.
It is an arithmetic number, because the mean of its divisors is an integer number (12676950720).
Almost surely, 2101122110211 is an apocalyptic number.
101122110211 is a deficient number, since it is larger than the sum of its proper divisors (293495549).
101122110211 is an equidigital number, since it uses as much as digits as its factorization.
101122110211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 206753.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101122110211 its reverse (112011221101), we get a palindrome (213133331312).
The spelling of 101122110211 in words is "one hundred one billion, one hundred twenty-two million, one hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •