Base | Representation |
---|---|
bin | 101011110011011001111… |
… | …0001000011000101101000 |
3 | 210022112100122000101202010 |
4 | 1113212303301003011220 |
5 | 1242114000340123224 |
6 | 20445401023435520 |
7 | 1160643532353330 |
oct | 127466361030550 |
9 | 23275318011663 |
10 | 6020265161064 |
11 | 1a111a880a950 |
12 | 812926755ba0 |
13 | 348929957b6b |
14 | 16b54d3ba0c0 |
15 | a690312ee29 |
hex | 579b3c43168 |
6020265161064 has 256 divisors, whose sum is σ = 19235273472000. Its totient is φ = 1524952535040.
The previous prime is 6020265161023. The next prime is 6020265161069. The reversal of 6020265161064 is 4601615620206.
It is a super-2 number, since 2×60202651610642 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (6020265161069) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 11755747 + ... + 12257165.
It is an arithmetic number, because the mean of its divisors is an integer number (75137787000).
Almost surely, 26020265161064 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 6020265161064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9617636736000).
6020265161064 is an abundant number, since it is smaller than the sum of its proper divisors (13215008310936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6020265161064 is a wasteful number, since it uses less digits than its factorization.
6020265161064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 501608 (or 501604 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 39.
The spelling of 6020265161064 in words is "six trillion, twenty billion, two hundred sixty-five million, one hundred sixty-one thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •