Base | Representation |
---|---|
bin | 110000000000101000… |
… | …0011011101101100011 |
3 | 100212010020101220111111 |
4 | 1200001100123231203 |
5 | 3142122134101011 |
6 | 115210313124151 |
7 | 10306631043253 |
oct | 1400120335543 |
9 | 325106356444 |
10 | 103100300131 |
11 | 3a7a7482514 |
12 | 17b940b9657 |
13 | 9950c1126a |
14 | 4dc0ad5963 |
15 | 2a364e2121 |
hex | 180141bb63 |
103100300131 has 4 divisors (see below), whose sum is σ = 103501468872. Its totient is φ = 102699131392.
The previous prime is 103100300119. The next prime is 103100300137. The reversal of 103100300131 is 131003001301.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 131003001301 = 2909 ⋅45033689.
It is a cyclic number.
It is not a de Polignac number, because 103100300131 - 211 = 103100298083 is a prime.
It is a super-2 number, since 2×1031003001312 (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 (103100300137) 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, 200583985 + ... + 200584498.
It is an arithmetic number, because the mean of its divisors is an integer number (25875367218).
Almost surely, 2103100300131 is an apocalyptic number.
103100300131 is a deficient number, since it is larger than the sum of its proper divisors (401168741).
103100300131 is an equidigital number, since it uses as much as digits as its factorization.
103100300131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 401168740.
The product of its (nonzero) digits is 27, while the sum is 13.
Adding to 103100300131 its reverse (131003001301), we get a palindrome (234103301432).
The spelling of 103100300131 in words is "one hundred three billion, one hundred million, three hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •