Base | Representation |
---|---|
bin | 1100111011000001100… |
… | …01000011011100110101 |
3 | 1120110001110221020111202 |
4 | 12131200301003130311 |
5 | 24233310301302123 |
6 | 535550110142245 |
7 | 44035601052104 |
oct | 6354061033465 |
9 | 1513043836452 |
10 | 444005103413 |
11 | 16133533a963 |
12 | 720744b1985 |
13 | 32b3c3ab181 |
14 | 176c065203b |
15 | b839d12a28 |
hex | 6760c43735 |
444005103413 has 2 divisors, whose sum is σ = 444005103414. Its totient is φ = 444005103412.
The previous prime is 444005103329. The next prime is 444005103449. The reversal of 444005103413 is 314301500444.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 443926373284 + 78730129 = 666278^2 + 8873^2 .
It is a cyclic number.
It is not a de Polignac number, because 444005103413 - 234 = 426825234229 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (444005103013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 222002551706 + 222002551707.
It is an arithmetic number, because the mean of its divisors is an integer number (222002551707).
Almost surely, 2444005103413 is an apocalyptic number.
It is an amenable number.
444005103413 is a deficient number, since it is larger than the sum of its proper divisors (1).
444005103413 is an equidigital number, since it uses as much as digits as its factorization.
444005103413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11520, while the sum is 29.
Adding to 444005103413 its reverse (314301500444), we get a palindrome (758306603857).
The spelling of 444005103413 in words is "four hundred forty-four billion, five million, one hundred three thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •