Base | Representation |
---|---|
bin | 111010001101101101000… |
… | …100011001011110011001 |
3 | 112011102211211221200100202 |
4 | 322031231010121132121 |
5 | 1011020402233001131 |
6 | 12301440115311545 |
7 | 562010512351154 |
oct | 72155504313631 |
9 | 15142754850322 |
10 | 4000444422041 |
11 | 1302640648511 |
12 | 5473908ab5b5 |
13 | 230317bc1562 |
14 | db8a0388c9b |
15 | 6e0d9ee5bcb |
hex | 3a36d119799 |
4000444422041 has 2 divisors, whose sum is σ = 4000444422042. Its totient is φ = 4000444422040.
The previous prime is 4000444422019. The next prime is 4000444422043. The reversal of 4000444422041 is 1402244440004.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3973185091225 + 27259330816 = 1993285^2 + 165104^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4000444422041 is a prime.
Together with 4000444422043, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 4000444421995 and 4000444422013.
It is not a weakly prime, because it can be changed into another prime (4000444422043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2000222211020 + 2000222211021.
It is an arithmetic number, because the mean of its divisors is an integer number (2000222211021).
Almost surely, 24000444422041 is an apocalyptic number.
It is an amenable number.
4000444422041 is a deficient number, since it is larger than the sum of its proper divisors (1).
4000444422041 is an equidigital number, since it uses as much as digits as its factorization.
4000444422041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16384, while the sum is 29.
Adding to 4000444422041 its reverse (1402244440004), we get a palindrome (5402688862045).
The spelling of 4000444422041 in words is "four trillion, four hundred forty-four million, four hundred twenty-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •