Base | Representation |
---|---|
bin | 101111000101111100… |
… | …0100110001010011101 |
3 | 100200001000001001100211 |
4 | 1132023320212022131 |
5 | 3124104031222323 |
6 | 114243050452421 |
7 | 10210060212220 |
oct | 1361370461235 |
9 | 320030031324 |
10 | 101131117213 |
11 | 39986974215 |
12 | 17724734111 |
13 | 96c8c66a79 |
14 | 4c7537d5b7 |
15 | 296d6ba70d |
hex | 178be2629d |
101131117213 has 4 divisors (see below), whose sum is σ = 115578419680. Its totient is φ = 86683814748.
The previous prime is 101131117177. The next prime is 101131117237. The reversal of 101131117213 is 312711131101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 312711131101 = 131 ⋅2387107871.
It is a cyclic number.
It is not a de Polignac number, because 101131117213 - 213 = 101131109021 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101131117313) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7223651223 + ... + 7223651236.
It is an arithmetic number, because the mean of its divisors is an integer number (28894604920).
Almost surely, 2101131117213 is an apocalyptic number.
It is an amenable number.
101131117213 is a deficient number, since it is larger than the sum of its proper divisors (14447302467).
101131117213 is an equidigital number, since it uses as much as digits as its factorization.
101131117213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14447302466.
The product of its (nonzero) digits is 126, while the sum is 22.
Adding to 101131117213 its reverse (312711131101), we get a palindrome (413842248314).
The spelling of 101131117213 in words is "one hundred one billion, one hundred thirty-one million, one hundred seventeen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •