Base | Representation |
---|---|
bin | 1011001100100010… |
… | …00011000000000000 |
3 | 120111220012210212100 |
4 | 11212101003000000 |
5 | 44302220241224 |
6 | 2432234230400 |
7 | 301644131610 |
oct | 54621030000 |
9 | 16456183770 |
10 | 6010712064 |
11 | 2604987a35 |
12 | 11b8b85400 |
13 | 74a379776 |
14 | 4103daa40 |
15 | 252a51ac9 |
hex | 166443000 |
6010712064 has 156 divisors (see below), whose sum is σ = 19843320016. Its totient is φ = 1717272576.
The previous prime is 6010712051. The next prime is 6010712069. The reversal of 6010712064 is 4602170106.
It is a super-2 number, since 2×60107120642 = 72257319032630280192, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (6010712069) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 246402 + ... + 269694.
Almost surely, 26010712064 is an apocalyptic number.
6010712064 is a gapful number since it is divisible by the number (64) 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 6010712064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9921660008).
6010712064 is an abundant number, since it is smaller than the sum of its proper divisors (13832607952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6010712064 is a wasteful number, since it uses less digits than its factorization.
6010712064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23330 (or 23305 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 27.
The square root of 6010712064 is about 77528.7821650772. The cubic root of 6010712064 is about 1818.2013450315.
The spelling of 6010712064 in words is "six billion, ten million, seven hundred twelve thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •