Base | Representation |
---|---|
bin | 11001010111100… |
… | …111001010001001 |
3 | 1002122212202000121 |
4 | 121113213022021 |
5 | 1332424320410 |
6 | 110122303241 |
7 | 13355465641 |
oct | 3127471211 |
9 | 1078782017 |
10 | 425620105 |
11 | 1a9284759 |
12 | ba657b21 |
13 | 6a241b21 |
14 | 40753521 |
15 | 275749da |
hex | 195e7289 |
425620105 has 4 divisors (see below), whose sum is σ = 510744132. Its totient is φ = 340496080.
The previous prime is 425620093. The next prime is 425620123. The reversal of 425620105 is 501026524.
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 193849929 + 231770176 = 13923^2 + 15224^2 .
It is not a de Polignac number, because 425620105 - 211 = 425618057 is a prime.
It is a super-2 number, since 2×4256201052 = 362304947560422050, 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 425620105.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 42562006 + ... + 42562015.
It is an arithmetic number, because the mean of its divisors is an integer number (127686033).
Almost surely, 2425620105 is an apocalyptic number.
It is an amenable number.
425620105 is a deficient number, since it is larger than the sum of its proper divisors (85124027).
425620105 is an equidigital number, since it uses as much as digits as its factorization.
425620105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85124026.
The product of its (nonzero) digits is 2400, while the sum is 25.
The square root of 425620105 is about 20630.5624014470. The cubic root of 425620105 is about 752.2127864955.
Adding to 425620105 its reverse (501026524), we get a palindrome (926646629).
The spelling of 425620105 in words is "four hundred twenty-five million, six hundred twenty thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •