Base | Representation |
---|---|
bin | 100101000000100… |
… | …001110001111000 |
3 | 1121021022202022011 |
4 | 211000201301320 |
5 | 2232422122402 |
6 | 141335535304 |
7 | 21246344350 |
oct | 4500416170 |
9 | 1537282264 |
10 | 620895352 |
11 | 29952a960 |
12 | 153b2a534 |
13 | 9b8336cc |
14 | 5c665b60 |
15 | 39798ed7 |
hex | 25021c78 |
620895352 has 128 divisors (see below), whose sum is σ = 1549601280. Its totient is φ = 225792000.
The previous prime is 620895277. The next prime is 620895377. The reversal of 620895352 is 253598026.
It is a super-2 number, since 2×6208953522 = 771022076270407808, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 2209452 + ... + 2209732.
It is an arithmetic number, because the mean of its divisors is an integer number (12106260).
Almost surely, 2620895352 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 620895352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (774800640).
620895352 is an abundant number, since it is smaller than the sum of its proper divisors (928705928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
620895352 is a wasteful number, since it uses less digits than its factorization.
620895352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 533 (or 529 counting only the distinct ones).
The product of its (nonzero) digits is 129600, while the sum is 40.
The square root of 620895352 is about 24917.7718104970. The cubic root of 620895352 is about 853.1121677541.
The spelling of 620895352 in words is "six hundred twenty million, eight hundred ninety-five thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •