Base | Representation |
---|---|
bin | 110010001100… |
… | …111001011011 |
3 | 220202121011102 |
4 | 302030321123 |
5 | 11332110102 |
6 | 1150022015 |
7 | 216600266 |
oct | 62147133 |
9 | 26677142 |
10 | 13160027 |
11 | 7479361 |
12 | 44a790b |
13 | 2959cca |
14 | 1a67cdd |
15 | 124e402 |
hex | c8ce5b |
13160027 has 8 divisors (see below), whose sum is σ = 14300160. Its totient is φ = 12064680.
The previous prime is 13159999. The next prime is 13160029. The reversal of 13160027 is 72006131.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13160027 - 216 = 13094491 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13159990 and 13160008.
It is not an unprimeable number, because it can be changed into a prime (13160029) by changing a digit.
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 in 7 ways as a sum of consecutive naturals, for example, 10583 + ... + 11760.
It is an arithmetic number, because the mean of its divisors is an integer number (1787520).
Almost surely, 213160027 is an apocalyptic number.
13160027 is a deficient number, since it is larger than the sum of its proper divisors (1140133).
13160027 is a wasteful number, since it uses less digits than its factorization.
With its successor (13160028) it forms a Ruth-Aaron pair, since the sum of their distinct prime factors is the same (22393).
13160027 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22393.
The product of its (nonzero) digits is 252, while the sum is 20.
The square root of 13160027 is about 3627.6751508370. The cubic root of 13160027 is about 236.0943496639.
Adding to 13160027 its reverse (72006131), we get a palindrome (85166158).
The spelling of 13160027 in words is "thirteen million, one hundred sixty thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •