Base | Representation |
---|---|
bin | 100100111101100… |
… | …100101000011101 |
3 | 1121012212101112211 |
4 | 210331210220131 |
5 | 2232222324410 |
6 | 141311200421 |
7 | 21236636536 |
oct | 4475445035 |
9 | 1535771484 |
10 | 620120605 |
11 | 299050875 |
12 | 153816111 |
13 | 9b621b90 |
14 | 5c50368d |
15 | 3969468a |
hex | 24f64a1d |
620120605 has 8 divisors (see below), whose sum is σ = 801386712. Its totient is φ = 457935168.
The previous prime is 620120597. The next prime is 620120647. The reversal of 620120605 is 506021026.
620120605 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 4782969 + 615337636 = 2187^2 + 24806^2 .
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 620120605 - 23 = 620120597 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4770094 + ... + 4770223.
It is an arithmetic number, because the mean of its divisors is an integer number (100173339).
Almost surely, 2620120605 is an apocalyptic number.
620120605 is a gapful number since it is divisible by the number (65) formed by its first and last digit.
It is an amenable number.
620120605 is a deficient number, since it is larger than the sum of its proper divisors (181266107).
620120605 is a wasteful number, since it uses less digits than its factorization.
620120605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9540335.
The product of its (nonzero) digits is 720, while the sum is 22.
The square root of 620120605 is about 24902.2208848930. The cubic root of 620120605 is about 852.7571851265.
The spelling of 620120605 in words is "six hundred twenty million, one hundred twenty thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •