Base | Representation |
---|---|
bin | 101001110111001… |
… | …1101010000111101 |
3 | 10121220011111220001 |
4 | 1103232131100331 |
5 | 10334044444141 |
6 | 351215154301 |
7 | 46544434414 |
oct | 12356352075 |
9 | 3556144801 |
10 | 1404687421 |
11 | 660a004a5 |
12 | 332515991 |
13 | 1950301b7 |
14 | d47b247b |
15 | 834bda31 |
hex | 53b9d43d |
1404687421 has 4 divisors (see below), whose sum is σ = 1411818012. Its totient is φ = 1397556832.
The previous prime is 1404687419. The next prime is 1404687439. The reversal of 1404687421 is 1247864041.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1247864041 = 19697 ⋅63353.
It can be written as a sum of positive squares in 2 ways, for example, as 924464025 + 480223396 = 30405^2 + 21914^2 .
It is a cyclic number.
It is not a de Polignac number, because 1404687421 - 21 = 1404687419 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1404687821) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3565000 + ... + 3565393.
It is an arithmetic number, because the mean of its divisors is an integer number (352954503).
Almost surely, 21404687421 is an apocalyptic number.
It is an amenable number.
1404687421 is a deficient number, since it is larger than the sum of its proper divisors (7130591).
1404687421 is an equidigital number, since it uses as much as digits as its factorization.
1404687421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7130590.
The product of its (nonzero) digits is 43008, while the sum is 37.
The square root of 1404687421 is about 37479.1598224934. The cubic root of 1404687421 is about 1119.9360669820.
The spelling of 1404687421 in words is "one billion, four hundred four million, six hundred eighty-seven thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •