Base | Representation |
---|---|
bin | 1111100011101… |
… | …10000101111101 |
3 | 100002120110010112 |
4 | 13301312011331 |
5 | 231402212013 |
6 | 20541115405 |
7 | 3143202161 |
oct | 761660575 |
9 | 302513115 |
10 | 130507133 |
11 | 67738a39 |
12 | 37858b65 |
13 | 21065573 |
14 | 13492ca1 |
15 | b6cdba8 |
hex | 7c7617d |
130507133 has 2 divisors, whose sum is σ = 130507134. Its totient is φ = 130507132.
The previous prime is 130507099. The next prime is 130507171. The reversal of 130507133 is 331705031.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 111471364 + 19035769 = 10558^2 + 4363^2 .
It is a cyclic number.
It is not a de Polignac number, because 130507133 - 220 = 129458557 is a prime.
It is a super-2 number, since 2×1305071332 = 34064223527759378, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130507099 and 130507108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130507183) 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, 65253566 + 65253567.
It is an arithmetic number, because the mean of its divisors is an integer number (65253567).
Almost surely, 2130507133 is an apocalyptic number.
It is an amenable number.
130507133 is a deficient number, since it is larger than the sum of its proper divisors (1).
130507133 is an equidigital number, since it uses as much as digits as its factorization.
130507133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 945, while the sum is 23.
The square root of 130507133 is about 11423.9718574583. The cubic root of 130507133 is about 507.2375735619.
The spelling of 130507133 in words is "one hundred thirty million, five hundred seven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •