Base | Representation |
---|---|
bin | 10010000100001010111… |
… | …11000110110100000000 |
3 | 2012100011200102200012020 |
4 | 21002011133012310000 |
5 | 40132210443032340 |
6 | 1153052532401440 |
7 | 62562614604600 |
oct | 11020537066400 |
9 | 2170150380166 |
10 | 620714814720 |
11 | 21a275370490 |
12 | a0370176280 |
13 | 466c1460720 |
14 | 2208547cc00 |
15 | 1122d7359d0 |
hex | 90857c6d00 |
620714814720 has 3456 divisors, whose sum is σ = 3044046458880. Its totient is φ = 105366159360.
The previous prime is 620714814719. The next prime is 620714814739. The reversal of 620714814720 is 27418417026.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 383 ways as a sum of consecutive naturals, for example, 10520590051 + ... + 10520590109.
It is an arithmetic number, because the mean of its divisors is an integer number (880800480).
Almost surely, 2620714814720 is an apocalyptic number.
620714814720 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 620714814720, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1522023229440).
620714814720 is an abundant number, since it is smaller than the sum of its proper divisors (2423331644160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
620714814720 is a wasteful number, since it uses less digits than its factorization.
620714814720 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161 (or 140 counting only the distinct ones).
The product of its (nonzero) digits is 150528, while the sum is 42.
The spelling of 620714814720 in words is "six hundred twenty billion, seven hundred fourteen million, eight hundred fourteen thousand, seven hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •