Base | Representation |
---|---|
bin | 110011111101… |
… | …010110111101 |
3 | 221122000001020 |
4 | 303331112331 |
5 | 11441330134 |
6 | 1203534353 |
7 | 223526256 |
oct | 63752675 |
9 | 27560036 |
10 | 13620669 |
11 | 7763457 |
12 | 468a3b9 |
13 | 2a8b88a |
14 | 1b47b2d |
15 | 12e0b49 |
hex | cfd5bd |
13620669 has 16 divisors (see below), whose sum is σ = 19041792. Its totient is φ = 8643888.
The previous prime is 13620667. The next prime is 13620671. The reversal of 13620669 is 96602631.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (13620667) and next prime (13620671).
It is not a de Polignac number, because 13620669 - 21 = 13620667 is a prime.
It is a super-2 number, since 2×136206692 = 371045248015122, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13620667) 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 15 ways as a sum of consecutive naturals, for example, 20862 + ... + 21504.
It is an arithmetic number, because the mean of its divisors is an integer number (1190112).
Almost surely, 213620669 is an apocalyptic number.
It is an amenable number.
13620669 is a deficient number, since it is larger than the sum of its proper divisors (5421123).
13620669 is a wasteful number, since it uses less digits than its factorization.
13620669 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 976.
The product of its (nonzero) digits is 11664, while the sum is 33.
The square root of 13620669 is about 3690.6190537632. The cubic root of 13620669 is about 238.8174992577.
It can be divided in two parts, 1362066 and 9, that added together give a triangular number (1362075 = T1650).
The spelling of 13620669 in words is "thirteen million, six hundred twenty thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •