Base | Representation |
---|---|
bin | 101001110101111… |
… | …1101000110110101 |
3 | 10121211221012000110 |
4 | 1103223331012311 |
5 | 10333413001123 |
6 | 351153133233 |
7 | 46536033021 |
oct | 12353750665 |
9 | 3554835013 |
10 | 1404031413 |
11 | 6605a2644 |
12 | 33225a219 |
13 | 194b60725 |
14 | d4681381 |
15 | 833de493 |
hex | 53afd1b5 |
1404031413 has 8 divisors (see below), whose sum is σ = 1874155968. Its totient is φ = 934963904.
The previous prime is 1404031379. The next prime is 1404031417. The reversal of 1404031413 is 3141304041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1404031413 - 216 = 1403965877 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1404031413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1404031417) 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 in 7 ways as a sum of consecutive naturals, for example, 261156 + ... + 266477.
It is an arithmetic number, because the mean of its divisors is an integer number (234269496).
Almost surely, 21404031413 is an apocalyptic number.
It is an amenable number.
1404031413 is a deficient number, since it is larger than the sum of its proper divisors (470124555).
1404031413 is an equidigital number, since it uses as much as digits as its factorization.
1404031413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 528523.
The product of its (nonzero) digits is 576, while the sum is 21.
The square root of 1404031413 is about 37470.4071635204. The cubic root of 1404031413 is about 1119.7616980778.
Adding to 1404031413 its reverse (3141304041), we get a palindrome (4545335454).
The spelling of 1404031413 in words is "one billion, four hundred four million, thirty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •