Base | Representation |
---|---|
bin | 1000001100101010… |
… | …10101101010010101 |
3 | 102100201200100202221 |
4 | 10012111111222111 |
5 | 33003203134331 |
6 | 2004421302341 |
7 | 214031534563 |
oct | 40625255225 |
9 | 12321610687 |
10 | 4401224341 |
11 | 1959415a98 |
12 | a29b649b1 |
13 | 551aa1377 |
14 | 2da756a33 |
15 | 1ab5cb711 |
hex | 106555a95 |
4401224341 has 2 divisors, whose sum is σ = 4401224342. Its totient is φ = 4401224340.
The previous prime is 4401224339. The next prime is 4401224413. The reversal of 4401224341 is 1434221044.
Together with next prime (4401224413) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3722830225 + 678394116 = 61015^2 + 26046^2 .
It is a cyclic number.
It is not a de Polignac number, because 4401224341 - 21 = 4401224339 is a prime.
Together with 4401224339, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4401224141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2200612170 + 2200612171.
It is an arithmetic number, because the mean of its divisors is an integer number (2200612171).
Almost surely, 24401224341 is an apocalyptic number.
It is an amenable number.
4401224341 is a deficient number, since it is larger than the sum of its proper divisors (1).
4401224341 is an equidigital number, since it uses as much as digits as its factorization.
4401224341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3072, while the sum is 25.
The square root of 4401224341 is about 66341.7239827245. The cubic root of 4401224341 is about 1638.7945162914.
Adding to 4401224341 its reverse (1434221044), we get a palindrome (5835445385).
The spelling of 4401224341 in words is "four billion, four hundred one million, two hundred twenty-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •