Base | Representation |
---|---|
bin | 110011000100… |
… | …110110011011 |
3 | 221012020112201 |
4 | 303010312123 |
5 | 11411423321 |
6 | 1154551031 |
7 | 221543413 |
oct | 63046633 |
9 | 27166481 |
10 | 13389211 |
11 | 7615570 |
12 | 4598477 |
13 | 2a0a414 |
14 | 1ac7643 |
15 | 1297291 |
hex | cc4d9b |
13389211 has 8 divisors (see below), whose sum is σ = 14946624. Its totient is φ = 11888520.
The previous prime is 13389203. The next prime is 13389223. The reversal of 13389211 is 11298331.
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 13389211 - 23 = 13389203 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13389211.
It is not an unprimeable number, because it can be changed into a prime (13389011) 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 7 ways as a sum of consecutive naturals, for example, 13681 + ... + 14626.
It is an arithmetic number, because the mean of its divisors is an integer number (1868328).
Almost surely, 213389211 is an apocalyptic number.
13389211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13389211 is a deficient number, since it is larger than the sum of its proper divisors (1557413).
13389211 is a wasteful number, since it uses less digits than its factorization.
13389211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28361.
The product of its digits is 1296, while the sum is 28.
The square root of 13389211 is about 3659.1270816959. The cubic root of 13389211 is about 237.4570101321.
It can be divided in two parts, 133892 and 11, that added together give a triangular number (133903 = T517).
The spelling of 13389211 in words is "thirteen million, three hundred eighty-nine thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •