Base | Representation |
---|---|
bin | 100101000000011… |
… | …011001000101001 |
3 | 1121021021100222012 |
4 | 211000123020221 |
5 | 2232420240022 |
6 | 141335205305 |
7 | 21246202121 |
oct | 4500331051 |
9 | 1537240865 |
10 | 620868137 |
11 | 29951146a |
12 | 153b16835 |
13 | 9b8241c6 |
14 | 5c659c81 |
15 | 39790de2 |
hex | 2501b229 |
620868137 has 4 divisors (see below), whose sum is σ = 628348560. Its totient is φ = 613387716.
The previous prime is 620868121. The next prime is 620868179. The reversal of 620868137 is 731868026.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 620868137 - 24 = 620868121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 620868094 and 620868103.
It is not an unprimeable number, because it can be changed into a prime (620868037) 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 3 ways as a sum of consecutive naturals, for example, 3740087 + ... + 3740252.
It is an arithmetic number, because the mean of its divisors is an integer number (157087140).
Almost surely, 2620868137 is an apocalyptic number.
It is an amenable number.
620868137 is a deficient number, since it is larger than the sum of its proper divisors (7480423).
620868137 is an equidigital number, since it uses as much as digits as its factorization.
620868137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7480422.
The product of its (nonzero) digits is 96768, while the sum is 41.
The square root of 620868137 is about 24917.2257083328. The cubic root of 620868137 is about 853.0997030735.
The spelling of 620868137 in words is "six hundred twenty million, eight hundred sixty-eight thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •