Base | Representation |
---|---|
bin | 1000010001110100… |
… | …00100100100100001 |
3 | 102110201221022202022 |
4 | 10020322010210201 |
5 | 33100232024342 |
6 | 2013003031225 |
7 | 215064563003 |
oct | 41072044441 |
9 | 12421838668 |
10 | 4444408097 |
11 | 1980830648 |
12 | a4050b515 |
13 | 55aa1109c |
14 | 302398373 |
15 | 1b02ab9d2 |
hex | 108e84921 |
4444408097 has 2 divisors, whose sum is σ = 4444408098. Its totient is φ = 4444408096.
The previous prime is 4444408057. The next prime is 4444408099. The reversal of 4444408097 is 7908044444.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2476953361 + 1967454736 = 49769^2 + 44356^2 .
It is a cyclic number.
It is not a de Polignac number, because 4444408097 - 210 = 4444407073 is a prime.
It is a super-2 number, since 2×44444080972 = 39505526665358322818, which contains 22 as substring.
Together with 4444408099, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (4444408099) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2222204048 + 2222204049.
It is an arithmetic number, because the mean of its divisors is an integer number (2222204049).
Almost surely, 24444408097 is an apocalyptic number.
It is an amenable number.
4444408097 is a deficient number, since it is larger than the sum of its proper divisors (1).
4444408097 is an equidigital number, since it uses as much as digits as its factorization.
4444408097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 516096, while the sum is 44.
The square root of 4444408097 is about 66666.3940602760. The cubic root of 4444408097 is about 1644.1369008494.
The spelling of 4444408097 in words is "four billion, four hundred forty-four million, four hundred eight thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.162 sec. • engine limits •