Base | Representation |
---|---|
bin | 101001110110010… |
… | …1000101101111010 |
3 | 10121212021021001100 |
4 | 1103230220231322 |
5 | 10333434210132 |
6 | 351201032230 |
7 | 46540405554 |
oct | 12354505572 |
9 | 3555237040 |
10 | 1404210042 |
11 | 660704874 |
12 | 332325676 |
13 | 194bc3b21 |
14 | d46ca4d4 |
15 | 8342737c |
hex | 53b28b7a |
1404210042 has 48 divisors (see below), whose sum is σ = 3090178728. Its totient is φ = 460753920.
The previous prime is 1404209999. The next prime is 1404210043. The reversal of 1404210042 is 2400124041.
It can be written as a sum of positive squares in 4 ways, for example, as 644601321 + 759608721 = 25389^2 + 27561^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 1404209997 and 1404210024.
It is not an unprimeable number, because it can be changed into a prime (1404210043) 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 23 ways as a sum of consecutive naturals, for example, 1157028 + ... + 1158240.
Almost surely, 21404210042 is an apocalyptic number.
1404210042 is an abundant number, since it is smaller than the sum of its proper divisors (1685968686).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1404210042 is a wasteful number, since it uses less digits than its factorization.
1404210042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2175 (or 2172 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 18.
The square root of 1404210042 is about 37472.7906887117. The cubic root of 1404210042 is about 1119.8091835848.
Adding to 1404210042 its reverse (2400124041), we get a palindrome (3804334083).
The spelling of 1404210042 in words is "one billion, four hundred four million, two hundred ten thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •