Base | Representation |
---|---|
bin | 111100101000010100… |
… | …1100110110011110111 |
3 | 110110002000020010212021 |
4 | 1321100221212303313 |
5 | 4113123214244111 |
6 | 135451454534011 |
7 | 12256346421010 |
oct | 1712051466367 |
9 | 413060203767 |
10 | 130202103031 |
11 | 50244769130 |
12 | 21298507307 |
13 | c37ca17120 |
14 | 6432278007 |
15 | 35c0985d71 |
hex | 1e50a66cf7 |
130202103031 has 16 divisors (see below), whose sum is σ = 174816811008. Its totient is φ = 93651861600.
The previous prime is 130202103013. The next prime is 130202103089. The reversal of 130202103031 is 130301202031.
It is not a de Polignac number, because 130202103031 - 25 = 130202102999 is a prime.
It is a super-2 number, since 2×1302021030312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130202102996 and 130202103014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130202103011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 65035015 + ... + 65037016.
It is an arithmetic number, because the mean of its divisors is an integer number (10926050688).
Almost surely, 2130202103031 is an apocalyptic number.
130202103031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
130202103031 is a deficient number, since it is larger than the sum of its proper divisors (44614707977).
130202103031 is a wasteful number, since it uses less digits than its factorization.
130202103031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130072062.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 130202103031 its reverse (130301202031), we get a palindrome (260503305062).
The spelling of 130202103031 in words is "one hundred thirty billion, two hundred two million, one hundred three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •