Base | Representation |
---|---|
bin | 101001110110100… |
… | …0110110010111010 |
3 | 10121212111112001022 |
4 | 1103231012302322 |
5 | 10334002130432 |
6 | 351203422442 |
7 | 46541431004 |
oct | 12355066272 |
9 | 3555445038 |
10 | 1404333242 |
11 | 660789394 |
12 | 332384a22 |
13 | 194c37c20 |
14 | d471d374 |
15 | 8344db12 |
hex | 53b46cba |
1404333242 has 8 divisors (see below), whose sum is σ = 2268538356. Its totient is φ = 648153792.
The previous prime is 1404333239. The next prime is 1404333247. The reversal of 1404333242 is 2423334041.
It can be written as a sum of positive squares in 2 ways, for example, as 1240518841 + 163814401 = 35221^2 + 12799^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (26), and also a Moran number because the ratio is a prime number: 54012817 = 1404333242 / (1 + 4 + 0 + 4 + 3 + 3 + 3 + 2 + 4 + 2).
It is not an unprimeable number, because it can be changed into a prime (1404333247) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 27006383 + ... + 27006434.
Almost surely, 21404333242 is an apocalyptic number.
1404333242 is a deficient number, since it is larger than the sum of its proper divisors (864205114).
1404333242 is a wasteful number, since it uses less digits than its factorization.
1404333242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54012832.
The product of its (nonzero) digits is 6912, while the sum is 26.
The square root of 1404333242 is about 37474.4345120777. The cubic root of 1404333242 is about 1119.8419318805.
Adding to 1404333242 its reverse (2423334041), we get a palindrome (3827667283).
The spelling of 1404333242 in words is "one billion, four hundred four million, three hundred thirty-three thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •