Base | Representation |
---|---|
bin | 1110111010000000… |
… | …1111101011100001 |
3 | 101022212101201101001 |
4 | 3232200033223201 |
5 | 31143331231431 |
6 | 1501020312001 |
7 | 201105411244 |
oct | 35640175341 |
9 | 11285351331 |
10 | 4001430241 |
11 | 1773780846 |
12 | 9380a2601 |
13 | 4ba002703 |
14 | 29d60725b |
15 | 186458e61 |
hex | ee80fae1 |
4001430241 has 2 divisors, whose sum is σ = 4001430242. Its totient is φ = 4001430240.
The previous prime is 4001430227. The next prime is 4001430247. The reversal of 4001430241 is 1420341004.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3633557841 + 367872400 = 60279^2 + 19180^2 .
It is a cyclic number.
It is not a de Polignac number, because 4001430241 - 221 = 3999333089 is a prime.
It is a super-2 number, since 2×40014302412 = 32022887947178636162, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (4001430247) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2000715120 + 2000715121.
It is an arithmetic number, because the mean of its divisors is an integer number (2000715121).
Almost surely, 24001430241 is an apocalyptic number.
It is an amenable number.
4001430241 is a deficient number, since it is larger than the sum of its proper divisors (1).
4001430241 is an equidigital number, since it uses as much as digits as its factorization.
4001430241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 19.
The square root of 4001430241 is about 63256.8592407179. The cubic root of 4001430241 is about 1587.5902265952.
Adding to 4001430241 its reverse (1420341004), we get a palindrome (5421771245).
The spelling of 4001430241 in words is "four billion, one million, four hundred thirty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •