Base | Representation |
---|---|
bin | 110101000011… |
… | …000011100011 |
3 | 222011111122111 |
4 | 311003003203 |
5 | 12024444042 |
6 | 1214020151 |
7 | 226125463 |
oct | 65030343 |
9 | 28144574 |
10 | 13906147 |
11 | 7938992 |
12 | 47a7657 |
13 | 2b5b7b8 |
14 | 1bbdba3 |
15 | 134a517 |
hex | d430e3 |
13906147 has 2 divisors, whose sum is σ = 13906148. Its totient is φ = 13906146.
The previous prime is 13906141. The next prime is 13906159. The reversal of 13906147 is 74160931.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13906147 - 219 = 13381859 is a prime.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (13906141) 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 as a sum of consecutive naturals, namely, 6953073 + 6953074.
It is an arithmetic number, because the mean of its divisors is an integer number (6953074).
Almost surely, 213906147 is an apocalyptic number.
13906147 is a deficient number, since it is larger than the sum of its proper divisors (1).
13906147 is an equidigital number, since it uses as much as digits as its factorization.
13906147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 31.
The square root of 13906147 is about 3729.0946622471. The cubic root of 13906147 is about 240.4744491883.
The spelling of 13906147 in words is "thirteen million, nine hundred six thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •