Base | Representation |
---|---|
bin | 1110011110101… |
… | …0010101111101 |
3 | 11020021100010011 |
4 | 3213222111331 |
5 | 111021304301 |
6 | 10005343221 |
7 | 1335120415 |
oct | 347522575 |
9 | 136240104 |
10 | 60728701 |
11 | 31309410 |
12 | 18407b11 |
13 | c773857 |
14 | 80cb645 |
15 | 54e8a51 |
hex | 39ea57d |
60728701 has 4 divisors (see below), whose sum is σ = 66249504. Its totient is φ = 55207900.
The previous prime is 60728677. The next prime is 60728711. The reversal of 60728701 is 10782706.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 60728701 - 25 = 60728669 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (60728711) 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 3 ways as a sum of consecutive naturals, for example, 2760385 + ... + 2760406.
It is an arithmetic number, because the mean of its divisors is an integer number (16562376).
Almost surely, 260728701 is an apocalyptic number.
It is an amenable number.
60728701 is a deficient number, since it is larger than the sum of its proper divisors (5520803).
60728701 is a wasteful number, since it uses less digits than its factorization.
60728701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5520802.
The product of its (nonzero) digits is 4704, while the sum is 31.
The square root of 60728701 is about 7792.8621827927. The cubic root of 60728701 is about 393.0652620567.
The spelling of 60728701 in words is "sixty million, seven hundred twenty-eight thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •