Base | Representation |
---|---|
bin | 11001010101001… |
… | …100001110011101 |
3 | 1002121200111111202 |
4 | 121111030032131 |
5 | 1332244014001 |
6 | 110100525245 |
7 | 13350213533 |
oct | 3125141635 |
9 | 1077614452 |
10 | 424985501 |
11 | 1a8990996 |
12 | ba3b0825 |
13 | 6a07c015 |
14 | 4062a153 |
15 | 2749b96b |
hex | 1954c39d |
424985501 has 4 divisors (see below), whose sum is σ = 425026812. Its totient is φ = 424944192.
The previous prime is 424985471. The next prime is 424985503. The reversal of 424985501 is 105589424.
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 94109401 + 330876100 = 9701^2 + 18190^2 .
It is a cyclic number.
It is not a de Polignac number, because 424985501 - 214 = 424969117 is a prime.
It is a super-2 number, since 2×4249855012 = 361225352120442002, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (424985503) 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, 8405 + ... + 30341.
It is an arithmetic number, because the mean of its divisors is an integer number (106256703).
Almost surely, 2424985501 is an apocalyptic number.
It is an amenable number.
424985501 is a deficient number, since it is larger than the sum of its proper divisors (41311).
424985501 is a wasteful number, since it uses less digits than its factorization.
424985501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41310.
The product of its (nonzero) digits is 57600, while the sum is 38.
The square root of 424985501 is about 20615.1764726863. The cubic root of 424985501 is about 751.8387481747.
The spelling of 424985501 in words is "four hundred twenty-four million, nine hundred eighty-five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •