Base | Representation |
---|---|
bin | 101111001011010100… |
… | …0000001100000010011 |
3 | 100200111120010102001001 |
4 | 1132112220001200103 |
5 | 3124441144302011 |
6 | 114313005122431 |
7 | 10214406013045 |
oct | 1362650014023 |
9 | 320446112031 |
10 | 101311322131 |
11 | 39a696668a8 |
12 | 17774b59417 |
13 | 97273accb6 |
14 | 4c9128ba95 |
15 | 297e4147c1 |
hex | 1796a01813 |
101311322131 has 8 divisors (see below), whose sum is σ = 106847414720. Its totient is φ = 95795621352.
The previous prime is 101311322111. The next prime is 101311322141. The reversal of 101311322131 is 131223113101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101311322131 - 215 = 101311289363 is a prime.
It is a super-2 number, since 2×1013113221312 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101311322099 and 101311322108.
It is not an unprimeable number, because it can be changed into a prime (101311322111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5087745 + ... + 5107618.
It is an arithmetic number, because the mean of its divisors is an integer number (13355926840).
Almost surely, 2101311322131 is an apocalyptic number.
101311322131 is a deficient number, since it is larger than the sum of its proper divisors (5536092589).
101311322131 is a wasteful number, since it uses less digits than its factorization.
101311322131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10195905.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 101311322131 its reverse (131223113101), we get a palindrome (232534435232).
The spelling of 101311322131 in words is "one hundred one billion, three hundred eleven million, three hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •