Base | Representation |
---|---|
bin | 110011111010… |
… | …100111111101 |
3 | 221121102200102 |
4 | 303322213331 |
5 | 11441000334 |
6 | 1203410445 |
7 | 223451516 |
oct | 63724775 |
9 | 27542612 |
10 | 13609469 |
11 | 7755aa5 |
12 | 4683a25 |
13 | 2a86753 |
14 | 1b43a0d |
15 | 12dc67e |
hex | cfa9fd |
13609469 has 4 divisors (see below), whose sum is σ = 14410044. Its totient is φ = 12808896.
The previous prime is 13609433. The next prime is 13609481. The reversal of 13609469 is 96490631.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6916900 + 6692569 = 2630^2 + 2587^2 .
It is a cyclic number.
It is not a de Polignac number, because 13609469 - 220 = 12560893 is a prime.
It is a super-3 number, since 3×136094693 (a number of 22 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13609489) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 400262 + ... + 400295.
It is an arithmetic number, because the mean of its divisors is an integer number (3602511).
Almost surely, 213609469 is an apocalyptic number.
It is an amenable number.
13609469 is a deficient number, since it is larger than the sum of its proper divisors (800575).
13609469 is an equidigital number, since it uses as much as digits as its factorization.
13609469 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 800574.
The product of its (nonzero) digits is 34992, while the sum is 38.
The square root of 13609469 is about 3689.1013810954. The cubic root of 13609469 is about 238.7520230451.
The spelling of 13609469 in words is "thirteen million, six hundred nine thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •