Base | Representation |
---|---|
bin | 1111100101101… |
… | …11011011000101 |
3 | 100010002001012100 |
4 | 13302313123011 |
5 | 231434242400 |
6 | 20550542313 |
7 | 3145365264 |
oct | 762673305 |
9 | 303061170 |
10 | 130774725 |
11 | 67900a94 |
12 | 37967999 |
13 | 2112a2c3 |
14 | 135225db |
15 | b733100 |
hex | 7cb76c5 |
130774725 has 36 divisors (see below), whose sum is σ = 235029600. Its totient is φ = 69509280.
The previous prime is 130774723. The next prime is 130774741. The reversal of 130774725 is 527477031.
It is not a de Polignac number, because 130774725 - 21 = 130774723 is a prime.
It is a Curzon number.
It is a nialpdrome in base 15.
It is a self number, because there is not a number n which added to its sum of digits gives 130774725.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130774723) 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 35 ways as a sum of consecutive naturals, for example, 79966 + ... + 81584.
It is an arithmetic number, because the mean of its divisors is an integer number (6528600).
Almost surely, 2130774725 is an apocalyptic number.
130774725 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
130774725 is a deficient number, since it is larger than the sum of its proper divisors (104254875).
130774725 is a wasteful number, since it uses less digits than its factorization.
130774725 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1994 (or 1986 counting only the distinct ones).
The product of its (nonzero) digits is 41160, while the sum is 36.
The square root of 130774725 is about 11435.6777236856. The cubic root of 130774725 is about 507.5840170866.
The spelling of 130774725 in words is "one hundred thirty million, seven hundred seventy-four thousand, seven hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •