Base | Representation |
---|---|
bin | 10010000100001110100… |
… | …11001001011010000000 |
3 | 2012100020210200010200000 |
4 | 21002013103021122000 |
5 | 40132241234442143 |
6 | 1153055540400000 |
7 | 62563434300642 |
oct | 11020723113200 |
9 | 2170223603600 |
10 | 620745234048 |
11 | 21a290557a25 |
12 | a037a3a6000 |
13 | 466c7851524 |
14 | 2208951a892 |
15 | 11231243bd3 |
hex | 90874c9680 |
620745234048 has 576 divisors, whose sum is σ = 2016685288800. Its totient is φ = 189527869440.
The previous prime is 620745233923. The next prime is 620745234049. The reversal of 620745234048 is 840432547026.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (576).
It is a junction number, because it is equal to n+sod(n) for n = 620745233994 and 620745234012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (620745234049) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 567927390 + ... + 567928482.
Almost surely, 2620745234048 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 620745234048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1008342644400).
620745234048 is an abundant number, since it is smaller than the sum of its proper divisors (1395940054752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
620745234048 is a wasteful number, since it uses less digits than its factorization.
620745234048 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1203 (or 1148 counting only the distinct ones).
The product of its (nonzero) digits is 1290240, while the sum is 45.
The spelling of 620745234048 in words is "six hundred twenty billion, seven hundred forty-five million, two hundred thirty-four thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •