Base | Representation |
---|---|
bin | 1111100001110… |
… | …11000111000000 |
3 | 100002010011201111 |
4 | 13300323013000 |
5 | 231321444121 |
6 | 20532013104 |
7 | 3141144622 |
oct | 760730700 |
9 | 302104644 |
10 | 130265536 |
11 | 67593475 |
12 | 37761194 |
13 | 20cac5cb |
14 | 1342cc12 |
15 | b6822e1 |
hex | 7c3b1c0 |
130265536 has 14 divisors (see below), whose sum is σ = 258495800. Its totient is φ = 65132736.
The previous prime is 130265461. The next prime is 130265557. The reversal of 130265536 is 635562031.
It is a junction number, because it is equal to n+sod(n) for n = 130265498 and 130265507.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1017636 + ... + 1017763.
Almost surely, 2130265536 is an apocalyptic number.
130265536 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
130265536 is a deficient number, since it is larger than the sum of its proper divisors (128230264).
130265536 is an equidigital number, since it uses as much as digits as its factorization.
130265536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2035411 (or 2035401 counting only the distinct ones).
The product of its (nonzero) digits is 16200, while the sum is 31.
The square root of 130265536 is about 11413.3928347359. The cubic root of 130265536 is about 506.9243779750.
The spelling of 130265536 in words is "one hundred thirty million, two hundred sixty-five thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •