Base | Representation |
---|---|
bin | 110101000011… |
… | …110001000101 |
3 | 222011122122102 |
4 | 311003301011 |
5 | 12030042221 |
6 | 1214041445 |
7 | 226140125 |
oct | 65036105 |
9 | 28148572 |
10 | 13909061 |
11 | 79400a1 |
12 | 47a9285 |
13 | 2b5cc1a |
14 | 1bc0c85 |
15 | 134b30b |
hex | d43c45 |
13909061 has 2 divisors, whose sum is σ = 13909062. Its totient is φ = 13909060.
The previous prime is 13909033. The next prime is 13909079. The reversal of 13909061 is 16090931.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13653025 + 256036 = 3695^2 + 506^2 .
It is an emirp because it is prime and its reverse (16090931) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13909061 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13909261) 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, 6954530 + 6954531.
It is an arithmetic number, because the mean of its divisors is an integer number (6954531).
Almost surely, 213909061 is an apocalyptic number.
It is an amenable number.
13909061 is a deficient number, since it is larger than the sum of its proper divisors (1).
13909061 is an equidigital number, since it uses as much as digits as its factorization.
13909061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1458, while the sum is 29.
The square root of 13909061 is about 3729.4853532358. The cubic root of 13909061 is about 240.4912449646.
Adding to 13909061 its reverse (16090931), we get a palindrome (29999992).
The spelling of 13909061 in words is "thirteen million, nine hundred nine thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •