Base | Representation |
---|---|
bin | 100100111110010… |
… | …111010100010100 |
3 | 1121020020221022222 |
4 | 210332113110110 |
5 | 2232301000322 |
6 | 141315441512 |
7 | 21241463030 |
oct | 4476272424 |
9 | 1536227288 |
10 | 620328212 |
11 | 299182849 |
12 | 1538b6298 |
13 | 9b69551a |
14 | 5c5591c0 |
15 | 396d5e42 |
hex | 24f97514 |
620328212 has 48 divisors (see below), whose sum is σ = 1296072960. Its totient is φ = 254161152.
The previous prime is 620328209. The next prime is 620328217. The reversal of 620328212 is 212823026.
620328212 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (620328217) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 79928 + ... + 87344.
It is an arithmetic number, because the mean of its divisors is an integer number (27001520).
Almost surely, 2620328212 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 620328212, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (648036480).
620328212 is an abundant number, since it is smaller than the sum of its proper divisors (675744748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
620328212 is a wasteful number, since it uses less digits than its factorization.
620328212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7560 (or 7558 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 26.
The square root of 620328212 is about 24906.3889795370. The cubic root of 620328212 is about 852.8523379116.
The spelling of 620328212 in words is "six hundred twenty million, three hundred twenty-eight thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •