Base | Representation |
---|---|
bin | 100100111111100… |
… | …011111011010000 |
3 | 1121020211212202202 |
4 | 210333203323100 |
5 | 2232341021000 |
6 | 141330302332 |
7 | 21244240616 |
oct | 4477437320 |
9 | 1536755682 |
10 | 620642000 |
11 | 299377580 |
12 | 153a279a8 |
13 | 9b7752b4 |
14 | 5c5db6b6 |
15 | 39748dd5 |
hex | 24fe3ed0 |
620642000 has 80 divisors (see below), whose sum is σ = 1637198784. Its totient is φ = 225680000.
The previous prime is 620641997. The next prime is 620642023. The reversal of 620642000 is 246026.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 7895 + ... + 36105.
Almost surely, 2620642000 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 620642000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (818599392).
620642000 is an abundant number, since it is smaller than the sum of its proper divisors (1016556784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
620642000 is a wasteful number, since it uses less digits than its factorization.
620642000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28245 (or 28229 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
The square root of 620642000 is about 24912.6875306539. The cubic root of 620642000 is about 852.9961164863.
Adding to 620642000 its reverse (246026), we get a palindrome (620888026).
The spelling of 620642000 in words is "six hundred twenty million, six hundred forty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •