Base | Representation |
---|---|
bin | 1000111101001010… |
… | …0100110000000101 |
3 | 20012112120102010221 |
4 | 2033102210300011 |
5 | 14410411323023 |
6 | 1034314144341 |
7 | 113400520315 |
oct | 21722446005 |
9 | 6175512127 |
10 | 2404011013 |
11 | 1024002068 |
12 | 5711220b1 |
13 | 2c4091531 |
14 | 18b3c5445 |
15 | e10b985d |
hex | 8f4a4c05 |
2404011013 has 2 divisors, whose sum is σ = 2404011014. Its totient is φ = 2404011012.
The previous prime is 2404010981. The next prime is 2404011017. The reversal of 2404011013 is 3101104042.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2398844484 + 5166529 = 48978^2 + 2273^2 .
It is a cyclic number.
It is not a de Polignac number, because 2404011013 - 25 = 2404010981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2404011017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1202005506 + 1202005507.
It is an arithmetic number, because the mean of its divisors is an integer number (1202005507).
Almost surely, 22404011013 is an apocalyptic number.
It is an amenable number.
2404011013 is a deficient number, since it is larger than the sum of its proper divisors (1).
2404011013 is an equidigital number, since it uses as much as digits as its factorization.
2404011013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 16.
The square root of 2404011013 is about 49030.7149958065. The cubic root of 2404011013 is about 1339.6113473368.
Adding to 2404011013 its reverse (3101104042), we get a palindrome (5505115055).
It can be divided in two parts, 24040 and 11013, that added together give a palindrome (35053).
The spelling of 2404011013 in words is "two billion, four hundred four million, eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •