Base | Representation |
---|---|
bin | 11001000010101… |
… | …101110011111011 |
3 | 1002021120102221002 |
4 | 121002231303323 |
5 | 1330024023311 |
6 | 105405035215 |
7 | 13261102520 |
oct | 3102556373 |
9 | 1067512832 |
10 | 420142331 |
11 | 1a6183174 |
12 | b8855b0b |
13 | 6907473b |
14 | 3db29147 |
15 | 26d4193b |
hex | 190adcfb |
420142331 has 4 divisors (see below), whose sum is σ = 480162672. Its totient is φ = 360121992.
The previous prime is 420142309. The next prime is 420142409. The reversal of 420142331 is 133241024.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 420142331 - 226 = 353033467 is a prime.
It is a super-3 number, since 3×4201423313 (a number of 27 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (420142831) 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, 30010160 + ... + 30010173.
It is an arithmetic number, because the mean of its divisors is an integer number (120040668).
Almost surely, 2420142331 is an apocalyptic number.
420142331 is a deficient number, since it is larger than the sum of its proper divisors (60020341).
420142331 is an equidigital number, since it uses as much as digits as its factorization.
420142331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60020340.
The product of its (nonzero) digits is 576, while the sum is 20.
The square root of 420142331 is about 20497.3737586062. The cubic root of 420142331 is about 748.9718243023.
Adding to 420142331 its reverse (133241024), we get a palindrome (553383355).
The spelling of 420142331 in words is "four hundred twenty million, one hundred forty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •