Base | Representation |
---|---|
bin | 110010001101… |
… | …001101110001 |
3 | 220202122221122 |
4 | 302031031301 |
5 | 11332130304 |
6 | 1150032025 |
7 | 216604136 |
oct | 62151561 |
9 | 26678848 |
10 | 13161329 |
11 | 747a335 |
12 | 44a8615 |
13 | 295a78c |
14 | 1a6858d |
15 | 124e9be |
hex | c8d371 |
13161329 has 4 divisors (see below), whose sum is σ = 13585920. Its totient is φ = 12736740.
The previous prime is 13161301. The next prime is 13161347. The reversal of 13161329 is 92316131.
13161329 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 92316131 = 47 ⋅1964173.
It is a cyclic number.
It is not a de Polignac number, because 13161329 - 28 = 13161073 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13161298 and 13161307.
It is not an unprimeable number, because it can be changed into a prime (13161229) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 212249 + ... + 212310.
It is an arithmetic number, because the mean of its divisors is an integer number (3396480).
Almost surely, 213161329 is an apocalyptic number.
It is an amenable number.
13161329 is a deficient number, since it is larger than the sum of its proper divisors (424591).
13161329 is an equidigital number, since it uses as much as digits as its factorization.
13161329 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 424590.
The product of its digits is 972, while the sum is 26.
The square root of 13161329 is about 3627.8546001735. The cubic root of 13161329 is about 236.1021354814.
The spelling of 13161329 in words is "thirteen million, one hundred sixty-one thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •