Base | Representation |
---|---|
bin | 10010111011001011001 |
3 | 1011111122110 |
4 | 2113121121 |
5 | 124320441 |
6 | 21142533 |
7 | 5161635 |
oct | 2273131 |
9 | 1144573 |
10 | 620121 |
11 | 3939a7 |
12 | 25aa49 |
13 | 189348 |
14 | 121dc5 |
15 | c3b16 |
hex | 97659 |
620121 has 8 divisors (see below), whose sum is σ = 835744. Its totient is φ = 408960.
The previous prime is 620117. The next prime is 620159. The reversal of 620121 is 121026.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 620121 - 22 = 620117 is a prime.
It is a Duffinian number.
620121 is a lucky number.
It is a junction number, because it is equal to n+sod(n) for n = 620097 and 620106.
It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 620121.
It is not an unprimeable number, because it can be changed into a prime (620111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 775 + ... + 1356.
It is an arithmetic number, because the mean of its divisors is an integer number (104468).
2620121 is an apocalyptic number.
It is an amenable number.
620121 is a deficient number, since it is larger than the sum of its proper divisors (215623).
620121 is a wasteful number, since it uses less digits than its factorization.
620121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2231.
The product of its (nonzero) digits is 24, while the sum is 12.
The square root of 620121 is about 787.4776187296. The cubic root of 620121 is about 85.2757366188.
Adding to 620121 its reverse (121026), we get a palindrome (741147).
It can be divided in two parts, 620 and 121, that added together give a triangular number (741 = T38).
The spelling of 620121 in words is "six hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.147 sec. • engine limits •