Base | Representation |
---|---|
bin | 1100101110010001000110… |
… | …1101111001011011100001 |
3 | 1211112100001212021001010011 |
4 | 3023210101231321123201 |
5 | 3313143440431234312 |
6 | 45430243245404521 |
7 | 2642446413520615 |
oct | 313442155713341 |
9 | 54470055231104 |
10 | 13989005727457 |
11 | 4503782049a32 |
12 | 169b1b5869741 |
13 | 7a6208283537 |
14 | 36510024d345 |
15 | 193d45ae0da7 |
hex | cb911b796e1 |
13989005727457 has 2 divisors, whose sum is σ = 13989005727458. Its totient is φ = 13989005727456.
The previous prime is 13989005727443. The next prime is 13989005727491. The reversal of 13989005727457 is 75472750098931.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11651238118881 + 2337767608576 = 3413391^2 + 1528976^2 .
It is a cyclic number.
It is not a de Polignac number, because 13989005727457 - 219 = 13989005203169 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13989005727392 and 13989005727401.
It is not a weakly prime, because it can be changed into another prime (13989005727857) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6994502863728 + 6994502863729.
It is an arithmetic number, because the mean of its divisors is an integer number (6994502863729).
Almost surely, 213989005727457 is an apocalyptic number.
It is an amenable number.
13989005727457 is a deficient number, since it is larger than the sum of its proper divisors (1).
13989005727457 is an equidigital number, since it uses as much as digits as its factorization.
13989005727457 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 133358400, while the sum is 67.
The spelling of 13989005727457 in words is "thirteen trillion, nine hundred eighty-nine billion, five million, seven hundred twenty-seven thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •