Base | Representation |
---|---|
bin | 1000110100000111000000001… |
… | …0111110110011000101100001 |
3 | 10000100002211102020010120201001 |
4 | 2031001300002332303011201 |
5 | 1122244042441443312221 |
6 | 10035052320335512001 |
7 | 244434133005002620 |
oct | 21501600276630541 |
9 | 3010084366116631 |
10 | 620244867166561 |
11 | 16a6a140984651a |
12 | 5969373b088601 |
13 | 20811abc6525a0 |
14 | ad2402433d6b7 |
15 | 4ba8ed4428391 |
hex | 2341c02fb3161 |
620244867166561 has 16 divisors (see below), whose sum is σ = 763904403174528. Its totient is φ = 490404981168000.
The previous prime is 620244867166541. The next prime is 620244867166577. The reversal of 620244867166561 is 165661768442026.
It is a cyclic number.
It is not a de Polignac number, because 620244867166561 - 29 = 620244867166049 is a prime.
It is a super-2 number, since 2×6202448671665612 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 620244867166493 and 620244867166502.
It is not an unprimeable number, because it can be changed into a prime (620244867166541) 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, 2348550820 + ... + 2348814901.
It is an arithmetic number, because the mean of its divisors is an integer number (47744025198408).
Almost surely, 2620244867166561 is an apocalyptic number.
It is an amenable number.
620244867166561 is a deficient number, since it is larger than the sum of its proper divisors (143659536007967).
620244867166561 is a wasteful number, since it uses less digits than its factorization.
620244867166561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4697367192.
The product of its (nonzero) digits is 139345920, while the sum is 64.
The spelling of 620244867166561 in words is "six hundred twenty trillion, two hundred forty-four billion, eight hundred sixty-seven million, one hundred sixty-six thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •