Base | Representation |
---|---|
bin | 1111100010111… |
… | …11100101010011 |
3 | 100002101202122122 |
4 | 13301133211103 |
5 | 231341234211 |
6 | 20535124455 |
7 | 3142336313 |
oct | 761374523 |
9 | 302352578 |
10 | 130414931 |
11 | 67685739 |
12 | 3781372b |
13 | 210325ca |
14 | 1346b443 |
15 | b6b16db |
hex | 7c5f953 |
130414931 has 2 divisors, whose sum is σ = 130414932. Its totient is φ = 130414930.
The previous prime is 130414919. The next prime is 130414951. The reversal of 130414931 is 139414031.
It is a weak prime.
It is an emirp because it is prime and its reverse (139414031) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130414931 is a prime.
It is a super-2 number, since 2×1304149312 = 34016108455469522, which contains 22 as substring.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 130414931.
It is not a weakly prime, because it can be changed into another prime (130414901) 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 as a sum of consecutive naturals, namely, 65207465 + 65207466.
It is an arithmetic number, because the mean of its divisors is an integer number (65207466).
Almost surely, 2130414931 is an apocalyptic number.
130414931 is a deficient number, since it is larger than the sum of its proper divisors (1).
130414931 is an equidigital number, since it uses as much as digits as its factorization.
130414931 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 26.
The square root of 130414931 is about 11419.9356828311. The cubic root of 130414931 is about 507.1180926421.
Adding to 130414931 its reverse (139414031), we get a palindrome (269828962).
The spelling of 130414931 in words is "one hundred thirty million, four hundred fourteen thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •