Base | Representation |
---|---|
bin | 1111011100000110… |
… | …1011000101111001 |
3 | 101200211102220002202 |
4 | 3313001223011321 |
5 | 31441432123001 |
6 | 1523125035545 |
7 | 204462624623 |
oct | 36701530571 |
9 | 11624386082 |
10 | 4144411001 |
11 | 1837459365 |
12 | 977b55bb5 |
13 | 510814703 |
14 | 2b45c5c13 |
15 | 193c9d96b |
hex | f706b179 |
4144411001 has 2 divisors, whose sum is σ = 4144411002. Its totient is φ = 4144411000.
The previous prime is 4144410997. The next prime is 4144411003. The reversal of 4144411001 is 1001144414.
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., 3141042025 + 1003368976 = 56045^2 + 31676^2 .
It is a cyclic number.
It is not a de Polignac number, because 4144411001 - 22 = 4144410997 is a prime.
It is a super-2 number, since 2×41444110012 = 34352285090419644002, which contains 22 as substring.
Together with 4144411003, 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 (4144411003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2072205500 + 2072205501.
It is an arithmetic number, because the mean of its divisors is an integer number (2072205501).
Almost surely, 24144411001 is an apocalyptic number.
It is an amenable number.
4144411001 is a deficient number, since it is larger than the sum of its proper divisors (1).
4144411001 is an equidigital number, since it uses as much as digits as its factorization.
4144411001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 256, while the sum is 20.
The square root of 4144411001 is about 64377.0999735154. The cubic root of 4144411001 is about 1606.2788436008.
Adding to 4144411001 its reverse (1001144414), we get a palindrome (5145555415).
The spelling of 4144411001 in words is "four billion, one hundred forty-four million, four hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •