Base | Representation |
---|---|
bin | 1101000110011110011110… |
… | …0101011110100100110101 |
3 | 1220000002120222211222112102 |
4 | 3101213213211132210311 |
5 | 3342002224120024244 |
6 | 50345305152431445 |
7 | 3014502054510452 |
oct | 321474745364465 |
9 | 56002528758472 |
10 | 14404910704949 |
11 | 46540a7615326 |
12 | 1747927548585 |
13 | 8064b9a87a5b |
14 | 37b2b68ca829 |
15 | 19ea889b054e |
hex | d19e795e935 |
14404910704949 has 2 divisors, whose sum is σ = 14404910704950. Its totient is φ = 14404910704948.
The previous prime is 14404910704907. The next prime is 14404910704963. The reversal of 14404910704949 is 94940701940441.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12876485377924 + 1528425327025 = 3588382^2 + 1236295^2 .
It is a cyclic number.
It is not a de Polignac number, because 14404910704949 - 212 = 14404910700853 is a prime.
It is a super-2 number, since 2×144049107049492 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14404910704894 and 14404910704903.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14404910704969) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7202455352474 + 7202455352475.
It is an arithmetic number, because the mean of its divisors is an integer number (7202455352475).
Almost surely, 214404910704949 is an apocalyptic number.
It is an amenable number.
14404910704949 is a deficient number, since it is larger than the sum of its proper divisors (1).
14404910704949 is an equidigital number, since it uses as much as digits as its factorization.
14404910704949 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5225472, while the sum is 56.
The spelling of 14404910704949 in words is "fourteen trillion, four hundred four billion, nine hundred ten million, seven hundred four thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •