Base | Representation |
---|---|
bin | 110010011010… |
… | …000101110101 |
3 | 220212100021222 |
4 | 302122011311 |
5 | 11340322234 |
6 | 1151120125 |
7 | 220213661 |
oct | 62320565 |
9 | 26770258 |
10 | 13214069 |
11 | 7505a20 |
12 | 4513045 |
13 | 297879b |
14 | 1a7d8a1 |
15 | 126042e |
hex | c9a175 |
13214069 has 8 divisors (see below), whose sum is σ = 14805408. Its totient is φ = 11687760.
The previous prime is 13214057. The next prime is 13214081. The reversal of 13214069 is 96041231.
13214069 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (13214057) and next prime (13214081).
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 13214069 - 216 = 13148533 is a prime.
It is a super-2 number, since 2×132140692 = 349223239073522, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13214009) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15827 + ... + 16640.
It is an arithmetic number, because the mean of its divisors is an integer number (1850676).
Almost surely, 213214069 is an apocalyptic number.
It is an amenable number.
13214069 is a deficient number, since it is larger than the sum of its proper divisors (1591339).
13214069 is a wasteful number, since it uses less digits than its factorization.
13214069 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32515.
The product of its (nonzero) digits is 1296, while the sum is 26.
The square root of 13214069 is about 3635.1160916813. The cubic root of 13214069 is about 236.4170841970.
The spelling of 13214069 in words is "thirteen million, two hundred fourteen thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •