Base | Representation |
---|---|
bin | 11001000011000… |
… | …101110000011101 |
3 | 1002021202102110202 |
4 | 121003011300131 |
5 | 1330040143123 |
6 | 105411113245 |
7 | 13261661465 |
oct | 3103056035 |
9 | 1067672422 |
10 | 420240413 |
11 | 1a623a92a |
12 | b88a2825 |
13 | 690aa288 |
14 | 3db52ba5 |
15 | 26d60a28 |
hex | 190c5c1d |
420240413 has 4 divisors (see below), whose sum is σ = 431598300. Its totient is φ = 408882528.
The previous prime is 420240377. The next prime is 420240427. The reversal of 420240413 is 314042024.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 339922969 + 80317444 = 18437^2 + 8962^2 .
It is a cyclic number.
It is not a de Polignac number, because 420240413 - 26 = 420240349 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 (420240463) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5678888 + ... + 5678961.
It is an arithmetic number, because the mean of its divisors is an integer number (107899575).
Almost surely, 2420240413 is an apocalyptic number.
It is an amenable number.
420240413 is a deficient number, since it is larger than the sum of its proper divisors (11357887).
420240413 is a wasteful number, since it uses less digits than its factorization.
420240413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11357886.
The product of its (nonzero) digits is 768, while the sum is 20.
The square root of 420240413 is about 20499.7661693981. The cubic root of 420240413 is about 749.0301021233.
Adding to 420240413 its reverse (314042024), we get a palindrome (734282437).
The spelling of 420240413 in words is "four hundred twenty million, two hundred forty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •