Base | Representation |
---|---|
bin | 110011011000… |
… | …111111000001 |
3 | 221100102200011 |
4 | 303120333001 |
5 | 11422043211 |
6 | 1200424521 |
7 | 222336016 |
oct | 63307701 |
9 | 27312604 |
10 | 13471681 |
11 | 7671523 |
12 | 4618141 |
13 | 2a38b12 |
14 | 1b0970d |
15 | 12b1921 |
hex | cd8fc1 |
13471681 has 4 divisors (see below), whose sum is σ = 13521664. Its totient is φ = 13421700.
The previous prime is 13471669. The next prime is 13471693. The reversal of 13471681 is 18617431.
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.
It is an interprime number because it is at equal distance from previous prime (13471669) and next prime (13471693).
It is a cyclic number.
It is not a de Polignac number, because 13471681 - 27 = 13471553 is a prime.
It is a super-2 number, since 2×134716812 = 362972377931522, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13471781) 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 3 ways as a sum of consecutive naturals, for example, 24585 + ... + 25126.
It is an arithmetic number, because the mean of its divisors is an integer number (3380416).
Almost surely, 213471681 is an apocalyptic number.
It is an amenable number.
13471681 is a deficient number, since it is larger than the sum of its proper divisors (49983).
13471681 is an equidigital number, since it uses as much as digits as its factorization.
13471681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49982.
The product of its digits is 4032, while the sum is 31.
The square root of 13471681 is about 3670.3788632783. The cubic root of 13471681 is about 237.9435463871.
The spelling of 13471681 in words is "thirteen million, four hundred seventy-one thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •