Base | Representation |
---|---|
bin | 101111000101111100… |
… | …0111111110000001111 |
3 | 100200001000020101010222 |
4 | 1132023320333300033 |
5 | 3124104043101111 |
6 | 114243053021555 |
7 | 10210061126630 |
oct | 1361370776017 |
9 | 320030211128 |
10 | 101131222031 |
11 | 39986a35a44 |
12 | 177247848bb |
13 | 96c8ca26a8 |
14 | 4c753a9887 |
15 | 296d6db7db |
hex | 178be3fc0f |
101131222031 has 8 divisors (see below), whose sum is σ = 117537498240. Its totient is φ = 85214685528.
The previous prime is 101131222007. The next prime is 101131222033. The reversal of 101131222031 is 130222131101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101131222031 - 234 = 83951352847 is a prime.
It is a super-2 number, since 2×1011312220312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101131222033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 122434481 + ... + 122435306.
It is an arithmetic number, because the mean of its divisors is an integer number (14692187280).
Almost surely, 2101131222031 is an apocalyptic number.
101131222031 is a deficient number, since it is larger than the sum of its proper divisors (16406276209).
101131222031 is an equidigital number, since it uses as much as digits as its factorization.
101131222031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 244869853.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 101131222031 its reverse (130222131101), we get a palindrome (231353353132).
The spelling of 101131222031 in words is "one hundred one billion, one hundred thirty-one million, two hundred twenty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •