Base | Representation |
---|---|
bin | 101111001000000101… |
… | …1001110100011110011 |
3 | 100200020000111200002012 |
4 | 1132100023032203303 |
5 | 3124230444011011 |
6 | 114254141513135 |
7 | 10211623146134 |
oct | 1362013164363 |
9 | 320200450065 |
10 | 101203110131 |
11 | 39a135765a2 |
12 | 177448727ab |
13 | 970ab52726 |
14 | 4c80b5dc8b |
15 | 2974b8ba8b |
hex | 17902ce8f3 |
101203110131 has 4 divisors (see below), whose sum is σ = 101931190200. Its totient is φ = 100475030064.
The previous prime is 101203110013. The next prime is 101203110157. The reversal of 101203110131 is 131011302101.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101203110131 - 218 = 101202847987 is a prime.
It is a super-2 number, since 2×1012031101312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101200110131) 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 3 ways as a sum of consecutive naturals, for example, 364039826 + ... + 364040103.
It is an arithmetic number, because the mean of its divisors is an integer number (25482797550).
Almost surely, 2101203110131 is an apocalyptic number.
101203110131 is a deficient number, since it is larger than the sum of its proper divisors (728080069).
101203110131 is an equidigital number, since it uses as much as digits as its factorization.
101203110131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 728080068.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 101203110131 its reverse (131011302101), we get a palindrome (232214412232).
The spelling of 101203110131 in words is "one hundred one billion, two hundred three million, one hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •