Base | Representation |
---|---|
bin | 110000100111011111… |
… | …1000000000110110001 |
3 | 100222111010012200100211 |
4 | 1201032333000012301 |
5 | 3202310003302312 |
6 | 115543535344121 |
7 | 10354144235065 |
oct | 1411677000661 |
9 | 328433180324 |
10 | 104404353457 |
11 | 40306599038 |
12 | 18298982041 |
13 | 9acb138151 |
14 | 50a5d8daa5 |
15 | 2ab0c333a7 |
hex | 184efc01b1 |
104404353457 has 2 divisors, whose sum is σ = 104404353458. Its totient is φ = 104404353456.
The previous prime is 104404353419. The next prime is 104404353463. The reversal of 104404353457 is 754353404401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 89210339761 + 15194013696 = 298681^2 + 123264^2 .
It is an emirp because it is prime and its reverse (754353404401) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 104404353457 - 231 = 102256869809 is a prime.
It is not a weakly prime, because it can be changed into another prime (104404753457) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52202176728 + 52202176729.
It is an arithmetic number, because the mean of its divisors is an integer number (52202176729).
Almost surely, 2104404353457 is an apocalyptic number.
It is an amenable number.
104404353457 is a deficient number, since it is larger than the sum of its proper divisors (1).
104404353457 is an equidigital number, since it uses as much as digits as its factorization.
104404353457 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 403200, while the sum is 40.
Adding to 104404353457 its reverse (754353404401), we get a palindrome (858757757858).
The spelling of 104404353457 in words is "one hundred four billion, four hundred four million, three hundred fifty-three thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •