Base | Representation |
---|---|
bin | 101001110110000… |
… | …0101001001100001 |
3 | 10121211222212012110 |
4 | 1103230011021201 |
5 | 10333420024403 |
6 | 351153545533 |
7 | 46536231036 |
oct | 12354051141 |
9 | 3554885173 |
10 | 1404064353 |
11 | 66061536a |
12 | 3322752a9 |
13 | 194b72713 |
14 | d468d38d |
15 | 833e9103 |
hex | 53b05261 |
1404064353 has 8 divisors (see below), whose sum is σ = 1872349600. Its totient is φ = 935911008.
The previous prime is 1404064351. The next prime is 1404064381. The reversal of 1404064353 is 3534604041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1404064353 - 21 = 1404064351 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1404064353.
It is not an unprimeable number, because it can be changed into a prime (1404064351) 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 in 7 ways as a sum of consecutive naturals, for example, 4663 + ... + 53196.
It is an arithmetic number, because the mean of its divisors is an integer number (234043700).
Almost surely, 21404064353 is an apocalyptic number.
It is an amenable number.
1404064353 is a deficient number, since it is larger than the sum of its proper divisors (468285247).
1404064353 is an equidigital number, since it uses as much as digits as its factorization.
1404064353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65951.
The product of its (nonzero) digits is 17280, while the sum is 30.
The square root of 1404064353 is about 37470.8467078074. The cubic root of 1404064353 is about 1119.7704549241.
Adding to 1404064353 its reverse (3534604041), we get a palindrome (4938668394).
The spelling of 1404064353 in words is "one billion, four hundred four million, sixty-four thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •