Base | Representation |
---|---|
bin | 1110011110011… |
… | …0100010100000 |
3 | 11020020112202002 |
4 | 3213212202200 |
5 | 111020304440 |
6 | 10005143132 |
7 | 1335024116 |
oct | 347464240 |
9 | 136215662 |
10 | 60713120 |
11 | 312a8736 |
12 | 183baaa8 |
13 | c769730 |
14 | 80c5ab6 |
15 | 54e4115 |
hex | 39e68a0 |
60713120 has 144 divisors (see below), whose sum is σ = 165713688. Its totient is φ = 20889600.
The previous prime is 60713101. The next prime is 60713161. The reversal of 60713120 is 2131706.
It is a happy number.
It can be written as a sum of positive squares in 12 ways, for example, as 26091664 + 34621456 = 5108^2 + 5884^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 60713092 and 60713101.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 601070 + ... + 601170.
Almost surely, 260713120 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 60713120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (82856844).
60713120 is an abundant number, since it is smaller than the sum of its proper divisors (105000568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
60713120 is a wasteful number, since it uses less digits than its factorization.
60713120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 163 (or 138 counting only the distinct ones).
The product of its (nonzero) digits is 252, while the sum is 20.
The square root of 60713120 is about 7791.8624217834. The cubic root of 60713120 is about 393.0316432813.
Adding to 60713120 its reverse (2131706), we get a palindrome (62844826).
The spelling of 60713120 in words is "sixty million, seven hundred thirteen thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •