Base | Representation |
---|---|
bin | 11001011111001… |
… | …011110010000001 |
3 | 1002210121120221201 |
4 | 121133023302001 |
5 | 1333431330441 |
6 | 110233021201 |
7 | 13411404106 |
oct | 3137136201 |
9 | 1083546851 |
10 | 427605121 |
11 | 1aa410069 |
12 | bb254801 |
13 | 6a7884a8 |
14 | 40b0caad |
15 | 27817c31 |
hex | 197cbc81 |
427605121 has 8 divisors (see below), whose sum is σ = 448167744. Its totient is φ = 407206800.
The previous prime is 427605109. The next prime is 427605133. The reversal of 427605121 is 121506724.
It is an interprime number because it is at equal distance from previous prime (427605109) and next prime (427605133).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 427605121 - 211 = 427603073 is a prime.
It is a super-2 number, since 2×4276051212 = 365692279010849282, which contains 22 as substring.
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 427605121.
It is not an unprimeable number, because it can be changed into a prime (427605151) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 35730 + ... + 46171.
It is an arithmetic number, because the mean of its divisors is an integer number (56020968).
Almost surely, 2427605121 is an apocalyptic number.
It is an amenable number.
427605121 is a deficient number, since it is larger than the sum of its proper divisors (20562623).
427605121 is a wasteful number, since it uses less digits than its factorization.
427605121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82151.
The product of its (nonzero) digits is 3360, while the sum is 28.
The square root of 427605121 is about 20678.6150648442. The cubic root of 427605121 is about 753.3803685141.
The spelling of 427605121 in words is "four hundred twenty-seven million, six hundred five thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •