Base | Representation |
---|---|
bin | 10010000100000011001… |
… | …11111110001011001000 |
3 | 2012100000011112020221120 |
4 | 21002001213332023020 |
5 | 40132042401423033 |
6 | 1153042300035240 |
7 | 62561200131306 |
oct | 11020147761310 |
9 | 2170004466846 |
10 | 620650029768 |
11 | 21a2418415aa |
12 | a0352532b20 |
13 | 466b0bc9832 |
14 | 2207aa17276 |
15 | 11227bda1b3 |
hex | 90819fe2c8 |
620650029768 has 16 divisors (see below), whose sum is σ = 1551625074480. Its totient is φ = 206883343248.
The previous prime is 620650029767. The next prime is 620650029899. The reversal of 620650029768 is 867920056026.
It is a super-2 number, since 2×6206500297682 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 620650029768.
It is not an unprimeable number, because it can be changed into a prime (620650029767) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12930208930 + ... + 12930208977.
It is an arithmetic number, because the mean of its divisors is an integer number (96976567155).
Almost surely, 2620650029768 is an apocalyptic number.
It is an amenable number.
620650029768 is an abundant number, since it is smaller than the sum of its proper divisors (930975044712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
620650029768 is a wasteful number, since it uses less digits than its factorization.
620650029768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25860417916 (or 25860417912 counting only the distinct ones).
The product of its (nonzero) digits is 2177280, while the sum is 51.
The spelling of 620650029768 in words is "six hundred twenty billion, six hundred fifty million, twenty-nine thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •