Base | Representation |
---|---|
bin | 101001110110011… |
… | …0000100111000101 |
3 | 10121212022220101210 |
4 | 1103230300213011 |
5 | 10333441223443 |
6 | 351201442033 |
7 | 46540602042 |
oct | 12354604705 |
9 | 3555286353 |
10 | 1404242373 |
11 | 660727096 |
12 | 332340319 |
13 | 194c05761 |
14 | d46d81c9 |
15 | 83431c33 |
hex | 53b309c5 |
1404242373 has 8 divisors (see below), whose sum is σ = 1880720128. Its totient is φ = 931963104.
The previous prime is 1404242351. The next prime is 1404242407. The reversal of 1404242373 is 3732424041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-1404242373 is a prime.
It is a super-2 number, since 2×14042423732 = 3943793284257342258, which contains 22 as substring.
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 1404242373.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1404242573) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1048840 + ... + 1050177.
It is an arithmetic number, because the mean of its divisors is an integer number (235090016).
Almost surely, 21404242373 is an apocalyptic number.
It is an amenable number.
1404242373 is a deficient number, since it is larger than the sum of its proper divisors (476477755).
1404242373 is a wasteful number, since it uses less digits than its factorization.
1404242373 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2099243.
The product of its (nonzero) digits is 16128, while the sum is 30.
The square root of 1404242373 is about 37473.2220792395. Note that the first 3 decimals coincide. The cubic root of 1404242373 is about 1119.8177778055.
The spelling of 1404242373 in words is "one billion, four hundred four million, two hundred forty-two thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •