Base | Representation |
---|---|
bin | 11001000010011… |
… | …101100000110001 |
3 | 1002021110001100102 |
4 | 121002131200301 |
5 | 1330014404234 |
6 | 105403402145 |
7 | 13260404054 |
oct | 3102354061 |
9 | 1067401312 |
10 | 420075569 |
11 | 1a6137aa1 |
12 | b8823355 |
13 | 69050234 |
14 | 3db0ca9b |
15 | 26d2bc7e |
hex | 1909d831 |
420075569 has 4 divisors (see below), whose sum is σ = 420116580. Its totient is φ = 420034560.
The previous prime is 420075563. The next prime is 420075571. The reversal of 420075569 is 965570024.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 358609969 + 61465600 = 18937^2 + 7840^2 .
It is a cyclic number.
It is not a de Polignac number, because 420075569 - 216 = 420010033 is a prime.
It is a super-2 number, since 2×4200755692 = 352926967341347522, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (420075563) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9329 + ... + 30449.
It is an arithmetic number, because the mean of its divisors is an integer number (105029145).
Almost surely, 2420075569 is an apocalyptic number.
It is an amenable number.
420075569 is a deficient number, since it is larger than the sum of its proper divisors (41011).
420075569 is a wasteful number, since it uses less digits than its factorization.
420075569 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41010.
The product of its (nonzero) digits is 75600, while the sum is 38.
The square root of 420075569 is about 20495.7451438097. The cubic root of 420075569 is about 748.9321508377.
The spelling of 420075569 in words is "four hundred twenty million, seventy-five thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •