Base | Representation |
---|---|
bin | 1111100001101… |
… | …10010111110011 |
3 | 100002002012002210 |
4 | 13300312113303 |
5 | 231320334011 |
6 | 20531343203 |
7 | 3141034221 |
oct | 760662763 |
9 | 302065083 |
10 | 130246131 |
11 | 6757a934 |
12 | 37751b03 |
13 | 20ca3822 |
14 | 13425b11 |
15 | b67b6a6 |
hex | 7c365f3 |
130246131 has 8 divisors (see below), whose sum is σ = 173905920. Its totient is φ = 86708552.
The previous prime is 130246117. The next prime is 130246133. The reversal of 130246131 is 131642031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 130246131 - 211 = 130244083 is a prime.
It is a super-2 number, since 2×1302461312 = 33928109280938322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130246098 and 130246107.
It is not an unprimeable number, because it can be changed into a prime (130246133) 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 7 ways as a sum of consecutive naturals, for example, 28035 + ... + 32348.
It is an arithmetic number, because the mean of its divisors is an integer number (21738240).
Almost surely, 2130246131 is an apocalyptic number.
130246131 is a deficient number, since it is larger than the sum of its proper divisors (43659789).
130246131 is an equidigital number, since it uses as much as digits as its factorization.
130246131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61105.
The product of its (nonzero) digits is 432, while the sum is 21.
The square root of 130246131 is about 11412.5427052870. The cubic root of 130246131 is about 506.8992054023.
Adding to 130246131 its reverse (131642031), we get a palindrome (261888162).
The spelling of 130246131 in words is "one hundred thirty million, two hundred forty-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.230 sec. • engine limits •