Base | Representation |
---|---|
bin | 1111100110111… |
… | …00110000110001 |
3 | 100010100210222210 |
4 | 13303130300301 |
5 | 232004141130 |
6 | 20554122333 |
7 | 3146603211 |
oct | 763346061 |
9 | 303323883 |
10 | 130927665 |
11 | 679a5990 |
12 | 37a203a9 |
13 | 21181abb |
14 | 13562241 |
15 | b7635b0 |
hex | 7cdcc31 |
130927665 has 32 divisors (see below), whose sum is σ = 233404416. Its totient is φ = 62125760.
The previous prime is 130927627. The next prime is 130927669. The reversal of 130927665 is 566729031.
It is a de Polignac number, because none of the positive numbers 2k-130927665 is a prime.
It is not an unprimeable number, because it can be changed into a prime (130927669) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 687 + ... + 16196.
It is an arithmetic number, because the mean of its divisors is an integer number (7293888).
Almost surely, 2130927665 is an apocalyptic number.
130927665 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
130927665 is a deficient number, since it is larger than the sum of its proper divisors (102476751).
130927665 is a wasteful number, since it uses less digits than its factorization.
130927665 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16949.
The product of its (nonzero) digits is 68040, while the sum is 39.
The square root of 130927665 is about 11442.3627367777. The cubic root of 130927665 is about 507.7818118228.
The spelling of 130927665 in words is "one hundred thirty million, nine hundred twenty-seven thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •