Base | Representation |
---|---|
bin | 100100111111100… |
… | …010110010011101 |
3 | 1121020211122101012 |
4 | 210333202302131 |
5 | 2232340343331 |
6 | 141330225005 |
7 | 21244221212 |
oct | 4477426235 |
9 | 1536748335 |
10 | 620637341 |
11 | 299374025 |
12 | 153a25165 |
13 | 9b77313c |
14 | 5c5d9b09 |
15 | 3974782b |
hex | 24fe2c9d |
620637341 has 4 divisors (see below), whose sum is σ = 629378784. Its totient is φ = 611895900.
The previous prime is 620637307. The next prime is 620637349. The reversal of 620637341 is 143736026.
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 a de Polignac number, because none of the positive numbers 2k-620637341 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 620637298 and 620637307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (620637349) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4370615 + ... + 4370756.
It is an arithmetic number, because the mean of its divisors is an integer number (157344696).
Almost surely, 2620637341 is an apocalyptic number.
It is an amenable number.
620637341 is a deficient number, since it is larger than the sum of its proper divisors (8741443).
620637341 is an equidigital number, since it uses as much as digits as its factorization.
620637341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8741442.
The product of its (nonzero) digits is 18144, while the sum is 32.
The square root of 620637341 is about 24912.5940239069. The cubic root of 620637341 is about 852.9939820734.
The spelling of 620637341 in words is "six hundred twenty million, six hundred thirty-seven thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •