Base | Representation |
---|---|
bin | 11010110010001011… |
… | …01001110000010001 |
3 | 1101010010200010022212 |
4 | 31121011221300101 |
5 | 213422131241412 |
6 | 10334511441505 |
7 | 1016224131242 |
oct | 153105516021 |
9 | 41103603285 |
10 | 14379555857 |
11 | 6109980167 |
12 | 2953826295 |
13 | 1482142b44 |
14 | 9a5a78cc9 |
15 | 592609222 |
hex | 359169c11 |
14379555857 has 2 divisors, whose sum is σ = 14379555858. Its totient is φ = 14379555856.
The previous prime is 14379555833. The next prime is 14379555899. The reversal of 14379555857 is 75855597341.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8702837521 + 5676718336 = 93289^2 + 75344^2 .
It is a cyclic number.
It is not a de Polignac number, because 14379555857 - 28 = 14379555601 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14379555796 and 14379555805.
It is not a weakly prime, because it can be changed into another prime (14379555457) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7189777928 + 7189777929.
It is an arithmetic number, because the mean of its divisors is an integer number (7189777929).
Almost surely, 214379555857 is an apocalyptic number.
It is an amenable number.
14379555857 is a deficient number, since it is larger than the sum of its proper divisors (1).
14379555857 is an equidigital number, since it uses as much as digits as its factorization.
14379555857 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 26460000, while the sum is 59.
The spelling of 14379555857 in words is "fourteen billion, three hundred seventy-nine million, five hundred fifty-five thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •