Base | Representation |
---|---|
bin | 110101000010… |
… | …110010011001 |
3 | 222011110010211 |
4 | 311002302121 |
5 | 12024430144 |
6 | 1214011121 |
7 | 226122334 |
oct | 65026231 |
9 | 28143124 |
10 | 13905049 |
11 | 7938084 |
12 | 47a6aa1 |
13 | 2b5b152 |
14 | 1bbd61b |
15 | 134a034 |
hex | d42c99 |
13905049 has 2 divisors, whose sum is σ = 13905050. Its totient is φ = 13905048.
The previous prime is 13905043. The next prime is 13905053. The reversal of 13905049 is 94050931.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13505625 + 399424 = 3675^2 + 632^2 .
It is a cyclic number.
It is not a de Polignac number, because 13905049 - 215 = 13872281 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13905049.
It is not a weakly prime, because it can be changed into another prime (13905043) 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, 6952524 + 6952525.
It is an arithmetic number, because the mean of its divisors is an integer number (6952525).
Almost surely, 213905049 is an apocalyptic number.
It is an amenable number.
13905049 is a deficient number, since it is larger than the sum of its proper divisors (1).
13905049 is an equidigital number, since it uses as much as digits as its factorization.
13905049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4860, while the sum is 31.
The square root of 13905049 is about 3728.9474386213. The cubic root of 13905049 is about 240.4681199035.
The spelling of 13905049 in words is "thirteen million, nine hundred five thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •