Base | Representation |
---|---|
bin | 11001010101010… |
… | …100101011011001 |
3 | 1002121202020222222 |
4 | 121111110223121 |
5 | 1332301120441 |
6 | 110101353425 |
7 | 13350416501 |
oct | 3125245331 |
9 | 1077666888 |
10 | 425020121 |
11 | 1a8a049a9 |
12 | ba408875 |
13 | 6a0919c6 |
14 | 40638a01 |
15 | 274a6d4b |
hex | 19554ad9 |
425020121 has 4 divisors (see below), whose sum is σ = 426059700. Its totient is φ = 423980544.
The previous prime is 425020117. The next prime is 425020133. The reversal of 425020121 is 121020524.
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 270142096 + 154878025 = 16436^2 + 12445^2 .
It is a cyclic number.
It is not a de Polignac number, because 425020121 - 22 = 425020117 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 425020121.
It is not an unprimeable number, because it can be changed into a prime (425020171) 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, 519176 + ... + 519993.
It is an arithmetic number, because the mean of its divisors is an integer number (106514925).
Almost surely, 2425020121 is an apocalyptic number.
It is an amenable number.
425020121 is a deficient number, since it is larger than the sum of its proper divisors (1039579).
425020121 is a wasteful number, since it uses less digits than its factorization.
425020121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1039578.
The product of its (nonzero) digits is 160, while the sum is 17.
The square root of 425020121 is about 20616.0161282436. The cubic root of 425020121 is about 751.8591629501.
Adding to 425020121 its reverse (121020524), we get a palindrome (546040645).
The spelling of 425020121 in words is "four hundred twenty-five million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •