Base | Representation |
---|---|
bin | 111000100001001110… |
… | …110100011011111000 |
3 | 12210122101102211112211 |
4 | 320201032310123320 |
5 | 1443241342400224 |
6 | 43513530344504 |
7 | 4245611425000 |
oct | 704116643370 |
9 | 183571384484 |
10 | 60687075064 |
11 | 238122a97a0 |
12 | b917b8b134 |
13 | 5951bc2595 |
14 | 2d19c25000 |
15 | 18a2c20894 |
hex | e213b46f8 |
60687075064 has 64 divisors (see below), whose sum is σ = 144761184000. Its totient is φ = 23644303200.
The previous prime is 60687075041. The next prime is 60687075067. The reversal of 60687075064 is 46057078606.
60687075064 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×606870750643 (a number of 33 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (49).
It is a junction number, because it is equal to n+sod(n) for n = 60687074999 and 60687075017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (60687075067) 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, 975102 + ... + 1035469.
It is an arithmetic number, because the mean of its divisors is an integer number (2261893500).
Almost surely, 260687075064 is an apocalyptic number.
It is an amenable number.
60687075064 is an abundant number, since it is smaller than the sum of its proper divisors (84074108936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
60687075064 is a wasteful number, since it uses less digits than its factorization.
60687075064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2010609 (or 2010591 counting only the distinct ones).
The product of its (nonzero) digits is 1693440, while the sum is 49.
The spelling of 60687075064 in words is "sixty billion, six hundred eighty-seven million, seventy-five thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •