Base | Representation |
---|---|
bin | 101111000101010101… |
… | …1111100001010000101 |
3 | 100122222121020010012120 |
4 | 1132022223330022011 |
5 | 3124033410202323 |
6 | 114241052040153 |
7 | 10206424336215 |
oct | 1361253741205 |
9 | 318877203176 |
10 | 101111022213 |
11 | 39976599583 |
12 | 17719a63059 |
13 | 96c4a4c336 |
14 | 4c7282c245 |
15 | 296ba4b5e3 |
hex | 178aafc285 |
101111022213 has 64 divisors (see below), whose sum is σ = 148203095040. Its totient is φ = 61063372800.
The previous prime is 101111022169. The next prime is 101111022253. The reversal of 101111022213 is 312220111101.
It is not a de Polignac number, because 101111022213 - 29 = 101111021701 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101111022192 and 101111022201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101111022253) 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 63 ways as a sum of consecutive naturals, for example, 61765231 + ... + 61766867.
It is an arithmetic number, because the mean of its divisors is an integer number (2315673360).
Almost surely, 2101111022213 is an apocalyptic number.
It is an amenable number.
101111022213 is a deficient number, since it is larger than the sum of its proper divisors (47092072827).
101111022213 is a wasteful number, since it uses less digits than its factorization.
101111022213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2078.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 101111022213 its reverse (312220111101), we get a palindrome (413331133314).
The spelling of 101111022213 in words is "one hundred one billion, one hundred eleven million, twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •