Base | Representation |
---|---|
bin | 1011010011010111… |
… | …01001100110000000 |
3 | 120122220001020012020 |
4 | 11221223221212000 |
5 | 44411403030121 |
6 | 2442042401440 |
7 | 303241204140 |
oct | 55153514600 |
9 | 16586036166 |
10 | 6068017536 |
11 | 2634268429 |
12 | 1214200280 |
13 | 7591c2129 |
14 | 417c76920 |
15 | 257ac11c6 |
hex | 169ae9980 |
6068017536 has 512 divisors, whose sum is σ = 21326976000. Its totient is φ = 1486356480.
The previous prime is 6068017523. The next prime is 6068017561. The reversal of 6068017536 is 6357108606.
It is a super-2 number, since 2×60680175362 = 73641673634407022592, which contains 22 as substring.
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 63 ways as a sum of consecutive naturals, for example, 25178376 + ... + 25178616.
It is an arithmetic number, because the mean of its divisors is an integer number (41654250).
Almost surely, 26068017536 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 6068017536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10663488000).
6068017536 is an abundant number, since it is smaller than the sum of its proper divisors (15258958464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6068017536 is a wasteful number, since it uses less digits than its factorization.
6068017536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 330 (or 318 counting only the distinct ones).
The product of its (nonzero) digits is 181440, while the sum is 42.
The square root of 6068017536 is about 77897.4809348800. The cubic root of 6068017536 is about 1823.9612564870.
The spelling of 6068017536 in words is "six billion, sixty-eight million, seventeen thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •