Base | Representation |
---|---|
bin | 110100001000… |
… | …001111000111 |
3 | 221201021011101 |
4 | 310020033013 |
5 | 11444241343 |
6 | 1204520531 |
7 | 224103205 |
oct | 64101707 |
9 | 27637141 |
10 | 13665223 |
11 | 7793980 |
12 | 46b0147 |
13 | 2aa5c40 |
14 | 1b5a075 |
15 | 12ede4d |
hex | d083c7 |
13665223 has 8 divisors (see below), whose sum is σ = 16054416. Its totient is φ = 11467200.
The previous prime is 13665163. The next prime is 13665257. The reversal of 13665223 is 32256631.
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 13665223 - 29 = 13664711 is a prime.
It is a super-3 number, since 3×136652233 (a number of 22 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13665191 and 13665200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13665283) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 47638 + ... + 47923.
It is an arithmetic number, because the mean of its divisors is an integer number (2006802).
Almost surely, 213665223 is an apocalyptic number.
13665223 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
13665223 is a deficient number, since it is larger than the sum of its proper divisors (2389193).
13665223 is a wasteful number, since it uses less digits than its factorization.
13665223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95585.
The product of its digits is 6480, while the sum is 28.
The square root of 13665223 is about 3696.6502404204. The cubic root of 13665223 is about 239.0776111570.
The spelling of 13665223 in words is "thirteen million, six hundred sixty-five thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •