Base | Representation |
---|---|
bin | 101010111010111… |
… | …111001001001100 |
3 | 1212012000011210211 |
4 | 222322333021030 |
5 | 2433321343220 |
6 | 155242212204 |
7 | 23562541402 |
oct | 5272771114 |
9 | 1765004724 |
10 | 720106060 |
11 | 33a532383 |
12 | 1811b4064 |
13 | b625bb7b |
14 | 6b8cd472 |
15 | 43344b5a |
hex | 2aebf24c |
720106060 has 48 divisors (see below), whose sum is σ = 1615432896. Its totient is φ = 268685312.
The previous prime is 720106021. The next prime is 720106067. The reversal of 720106060 is 60601027.
It is not an unprimeable number, because it can be changed into a prime (720106067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29049 + ... + 47791.
It is an arithmetic number, because the mean of its divisors is an integer number (33654852).
Almost surely, 2720106060 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 720106060, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (807716448).
720106060 is an abundant number, since it is smaller than the sum of its proper divisors (895326836).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
720106060 is a wasteful number, since it uses less digits than its factorization.
720106060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18882 (or 18880 counting only the distinct ones).
The product of its (nonzero) digits is 504, while the sum is 22.
The square root of 720106060 is about 26834.7919686365. The cubic root of 720106060 is about 896.3249562051.
Adding to 720106060 its reverse (60601027), we get a palindrome (780707087).
The spelling of 720106060 in words is "seven hundred twenty million, one hundred six thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.184 sec. • engine limits •