Base | Representation |
---|---|
bin | 110010100000010111111101… |
… | …0011010010000100001111001 |
3 | 2011020222021121002121201021112 |
4 | 1211000233322122100201321 |
5 | 431212124441210333314 |
6 | 4212503311441250105 |
7 | 162401205550463012 |
oct | 14500577232204171 |
9 | 2136867532551245 |
10 | 444254143449209 |
11 | 11960a140328275 |
12 | 419ab519933935 |
13 | 160b6ca8238802 |
14 | 7b9c02dc8a009 |
15 | 365610a77d43e |
hex | 1940bfa690879 |
444254143449209 has 2 divisors, whose sum is σ = 444254143449210. Its totient is φ = 444254143449208.
The previous prime is 444254143449161. The next prime is 444254143449239. The reversal of 444254143449209 is 902944341452444.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 433527699683584 + 10726443765625 = 20821328^2 + 3275125^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-444254143449209 is a prime.
It is not a weakly prime, because it can be changed into another prime (444254143449239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 222127071724604 + 222127071724605.
It is an arithmetic number, because the mean of its divisors is an integer number (222127071724605).
Almost surely, 2444254143449209 is an apocalyptic number.
It is an amenable number.
444254143449209 is a deficient number, since it is larger than the sum of its proper divisors (1).
444254143449209 is an equidigital number, since it uses as much as digits as its factorization.
444254143449209 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 79626240, while the sum is 59.
The spelling of 444254143449209 in words is "four hundred forty-four trillion, two hundred fifty-four billion, one hundred forty-three million, four hundred forty-nine thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •