Base | Representation |
---|---|
bin | 1111100101010… |
… | …11111100110111 |
3 | 100002222122201222 |
4 | 13302223330313 |
5 | 231431241420 |
6 | 20545540555 |
7 | 3145111265 |
oct | 762537467 |
9 | 302878658 |
10 | 130727735 |
11 | 67879756 |
12 | 3794475b |
13 | 21111ab8 |
14 | 1350d435 |
15 | b724225 |
hex | 7cabf37 |
130727735 has 4 divisors (see below), whose sum is σ = 156873288. Its totient is φ = 104582184.
The previous prime is 130727731. The next prime is 130727741. The reversal of 130727735 is 537727031.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 537727031 = 37 ⋅14533163.
It is a cyclic number.
It is not a de Polignac number, because 130727735 - 22 = 130727731 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130727695 and 130727704.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130727731) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13072769 + ... + 13072778.
It is an arithmetic number, because the mean of its divisors is an integer number (39218322).
Almost surely, 2130727735 is an apocalyptic number.
130727735 is a deficient number, since it is larger than the sum of its proper divisors (26145553).
130727735 is an equidigital number, since it uses as much as digits as its factorization.
130727735 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26145552.
The product of its (nonzero) digits is 30870, while the sum is 35.
The square root of 130727735 is about 11433.6230041050. The cubic root of 130727735 is about 507.5232147404.
The spelling of 130727735 in words is "one hundred thirty million, seven hundred twenty-seven thousand, seven hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •