Base | Representation |
---|---|
bin | 1110100001010… |
… | …1101010010101 |
3 | 11020121100111201 |
4 | 3220111222111 |
5 | 111042444013 |
6 | 10013232501 |
7 | 1336456621 |
oct | 350255225 |
9 | 136540451 |
10 | 60906133 |
11 | 3141a752 |
12 | 18492731 |
13 | c806542 |
14 | 8136181 |
15 | 55313dd |
hex | 3a15a95 |
60906133 has 4 divisors (see below), whose sum is σ = 60978060. Its totient is φ = 60834208.
The previous prime is 60906127. The next prime is 60906137. The reversal of 60906133 is 33160906.
60906133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 22676644 + 38229489 = 4762^2 + 6183^2 .
It is a cyclic number.
It is not a de Polignac number, because 60906133 - 25 = 60906101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (60906137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 34678 + ... + 36391.
It is an arithmetic number, because the mean of its divisors is an integer number (15244515).
Almost surely, 260906133 is an apocalyptic number.
It is an amenable number.
60906133 is a deficient number, since it is larger than the sum of its proper divisors (71927).
60906133 is an equidigital number, since it uses as much as digits as its factorization.
60906133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71926.
The product of its (nonzero) digits is 2916, while the sum is 28.
The square root of 60906133 is about 7804.2381434705. The cubic root of 60906133 is about 393.4476981593.
The spelling of 60906133 in words is "sixty million, nine hundred six thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •