Base | Representation |
---|---|
bin | 100111100000000110… |
… | …001111111110001101 |
3 | 11001110221020210222112 |
4 | 213200012033332031 |
5 | 1143331044042313 |
6 | 31252424353405 |
7 | 3031032536306 |
oct | 474006177615 |
9 | 131427223875 |
10 | 42414440333 |
11 | 16a95933881 |
12 | 8278615865 |
13 | 3ccc355b95 |
14 | 20a51097ad |
15 | 11839618a8 |
hex | 9e018ff8d |
42414440333 has 2 divisors, whose sum is σ = 42414440334. Its totient is φ = 42414440332.
The previous prime is 42414440279. The next prime is 42414440351. The reversal of 42414440333 is 33304441424.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 38892967369 + 3521472964 = 197213^2 + 59342^2 .
It is a cyclic number.
It is not a de Polignac number, because 42414440333 - 28 = 42414440077 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 42414440333.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (42414440533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21207220166 + 21207220167.
It is an arithmetic number, because the mean of its divisors is an integer number (21207220167).
Almost surely, 242414440333 is an apocalyptic number.
It is an amenable number.
42414440333 is a deficient number, since it is larger than the sum of its proper divisors (1).
42414440333 is an equidigital number, since it uses as much as digits as its factorization.
42414440333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 55296, while the sum is 32.
Adding to 42414440333 its reverse (33304441424), we get a palindrome (75718881757).
The spelling of 42414440333 in words is "forty-two billion, four hundred fourteen million, four hundred forty thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •