Base | Representation |
---|---|
bin | 11010011101110… |
… | …111001110101101 |
3 | 1010221112100220021 |
4 | 122131313032231 |
5 | 1402133123023 |
6 | 112021122141 |
7 | 14001146431 |
oct | 3235671655 |
9 | 1127470807 |
10 | 444036013 |
11 | 208712913 |
12 | 104859351 |
13 | 70cbc205 |
14 | 42d889c1 |
15 | 28eb135d |
hex | 1a7773ad |
444036013 has 2 divisors, whose sum is σ = 444036014. Its totient is φ = 444036012.
The previous prime is 444035951. The next prime is 444036031. The reversal of 444036013 is 310630444.
It is a happy number.
Together with next prime (444036031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 436517449 + 7518564 = 20893^2 + 2742^2 .
It is a cyclic number.
It is not a de Polignac number, because 444036013 - 213 = 444027821 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (444036113) 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, 222018006 + 222018007.
It is an arithmetic number, because the mean of its divisors is an integer number (222018007).
Almost surely, 2444036013 is an apocalyptic number.
It is an amenable number.
444036013 is a deficient number, since it is larger than the sum of its proper divisors (1).
444036013 is an equidigital number, since it uses as much as digits as its factorization.
444036013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 25.
The square root of 444036013 is about 21072.1620390505. The cubic root of 444036013 is about 762.9089880777.
Adding to 444036013 its reverse (310630444), we get a palindrome (754666457).
The spelling of 444036013 in words is "four hundred forty-four million, thirty-six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •