Base | Representation |
---|---|
bin | 100101000010010… |
… | …011110111011100 |
3 | 1121022012111022120 |
4 | 211002103313130 |
5 | 2233032101102 |
6 | 141353542540 |
7 | 21253331631 |
oct | 4502236734 |
9 | 1538174276 |
10 | 621362652 |
11 | 299819a59 |
12 | 154114a50 |
13 | 9b968311 |
14 | 5c748188 |
15 | 3983c6bc |
hex | 25093ddc |
621362652 has 12 divisors (see below), whose sum is σ = 1449846216. Its totient is φ = 207120880.
The previous prime is 621362633. The next prime is 621362657. The reversal of 621362652 is 256263126.
621362652 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (12).
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (621362657) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25890099 + ... + 25890122.
It is an arithmetic number, because the mean of its divisors is an integer number (120820518).
Almost surely, 2621362652 is an apocalyptic number.
It is an amenable number.
621362652 is an abundant number, since it is smaller than the sum of its proper divisors (828483564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
621362652 is a wasteful number, since it uses less digits than its factorization.
621362652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51780228 (or 51780226 counting only the distinct ones).
The product of its digits is 25920, while the sum is 33.
The square root of 621362652 is about 24927.1468884828. The cubic root of 621362652 is about 853.3261379737.
The spelling of 621362652 in words is "six hundred twenty-one million, three hundred sixty-two thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •