Base | Representation |
---|---|
bin | 110000101000101011… |
… | …1011110010110000001 |
3 | 100222120220102100112201 |
4 | 1201101113132112001 |
5 | 3202400221320301 |
6 | 115551524153201 |
7 | 10355141046001 |
oct | 1412127362601 |
9 | 328526370481 |
10 | 104444323201 |
11 | 40327108989 |
12 | 182aa238801 |
13 | 9b064c0c9a |
14 | 50ab3d6001 |
15 | 2ab44cb201 |
hex | 18515de581 |
104444323201 has 2 divisors, whose sum is σ = 104444323202. Its totient is φ = 104444323200.
The previous prime is 104444323187. The next prime is 104444323211. The reversal of 104444323201 is 102323444401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99089596225 + 5354726976 = 314785^2 + 73176^2 .
It is a cyclic number.
It is not a de Polignac number, because 104444323201 - 27 = 104444323073 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 104444323201.
It is not a weakly prime, because it can be changed into another prime (104444323211) 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, 52222161600 + 52222161601.
It is an arithmetic number, because the mean of its divisors is an integer number (52222161601).
Almost surely, 2104444323201 is an apocalyptic number.
It is an amenable number.
104444323201 is a deficient number, since it is larger than the sum of its proper divisors (1).
104444323201 is an equidigital number, since it uses as much as digits as its factorization.
104444323201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9216, while the sum is 28.
Adding to 104444323201 its reverse (102323444401), we get a palindrome (206767767602).
The spelling of 104444323201 in words is "one hundred four billion, four hundred forty-four million, three hundred twenty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •