Base | Representation |
---|---|
bin | 1111100000100… |
… | …11011011110111 |
3 | 100001210220210210 |
4 | 13300103123313 |
5 | 231301244111 |
6 | 20524320503 |
7 | 3136600062 |
oct | 760233367 |
9 | 301726723 |
10 | 130103031 |
11 | 67492373 |
12 | 376a3133 |
13 | 20c53656 |
14 | 133c98d9 |
15 | b64e0a6 |
hex | 7c136f7 |
130103031 has 4 divisors (see below), whose sum is σ = 173470712. Its totient is φ = 86735352.
The previous prime is 130103021. The next prime is 130103047. The reversal of 130103031 is 130301031.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 130103031 - 226 = 62994167 is a prime.
It is a super-2 number, since 2×1301030312 = 33853597350773922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130102998 and 130103016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130103011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21683836 + ... + 21683841.
It is an arithmetic number, because the mean of its divisors is an integer number (43367678).
Almost surely, 2130103031 is an apocalyptic number.
130103031 is a deficient number, since it is larger than the sum of its proper divisors (43367681).
130103031 is an equidigital number, since it uses as much as digits as its factorization.
130103031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43367680.
The product of its (nonzero) digits is 27, while the sum is 12.
The square root of 130103031 is about 11406.2715643632. The cubic root of 130103031 is about 506.7134958351.
Adding to 130103031 its reverse (130301031), we get a palindrome (260404062).
The spelling of 130103031 in words is "one hundred thirty million, one hundred three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •