Base | Representation |
---|---|
bin | 1110111111001010… |
… | …0010100001101001 |
3 | 101101100222201222001 |
4 | 3233302202201221 |
5 | 31214342100431 |
6 | 1503110531001 |
7 | 201456651265 |
oct | 35762424151 |
9 | 11340881861 |
10 | 4023003241 |
11 | 1784975974 |
12 | 943366a61 |
13 | 4c1616aba |
14 | 2a24210a5 |
15 | 1882bae61 |
hex | efca2869 |
4023003241 has 2 divisors, whose sum is σ = 4023003242. Its totient is φ = 4023003240.
The previous prime is 4023003203. The next prime is 4023003251. The reversal of 4023003241 is 1423003204.
4023003241 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3588489216 + 434514025 = 59904^2 + 20845^2 .
It is a cyclic number.
It is not a de Polignac number, because 4023003241 - 213 = 4022995049 is a prime.
It is not a weakly prime, because it can be changed into another prime (4023003251) 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, 2011501620 + 2011501621.
It is an arithmetic number, because the mean of its divisors is an integer number (2011501621).
Almost surely, 24023003241 is an apocalyptic number.
It is an amenable number.
4023003241 is a deficient number, since it is larger than the sum of its proper divisors (1).
4023003241 is an equidigital number, since it uses as much as digits as its factorization.
4023003241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 19.
The square root of 4023003241 is about 63427.1490845994. The cubic root of 4023003241 is about 1590.4381848091.
Adding to 4023003241 its reverse (1423003204), we get a palindrome (5446006445).
The spelling of 4023003241 in words is "four billion, twenty-three million, three thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •