Base | Representation |
---|---|
bin | 1110010101011… |
… | …0111111100101 |
3 | 11012010200012200 |
4 | 3211112333211 |
5 | 110343001112 |
6 | 5544405113 |
7 | 1330025001 |
oct | 345267745 |
9 | 135120180 |
10 | 60125157 |
11 | 30a36a14 |
12 | 18176799 |
13 | c5c1c21 |
14 | 7db1701 |
15 | 5429cdc |
hex | 3956fe5 |
60125157 has 12 divisors (see below), whose sum is σ = 87114144. Its totient is φ = 39960360.
The previous prime is 60125129. The next prime is 60125167. The reversal of 60125157 is 75152106.
60125157 is a `hidden beast` number, since 601 + 2 + 5 + 1 + 57 = 666.
It is not a de Polignac number, because 60125157 - 211 = 60123109 is a prime.
It is a Smith number, since the sum of its digits (27) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 60125157.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (60125167) 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 11 ways as a sum of consecutive naturals, for example, 7113 + ... + 13070.
It is an arithmetic number, because the mean of its divisors is an integer number (7259512).
Almost surely, 260125157 is an apocalyptic number.
It is an amenable number.
60125157 is a deficient number, since it is larger than the sum of its proper divisors (26988987).
60125157 is a wasteful number, since it uses less digits than its factorization.
60125157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20520 (or 20517 counting only the distinct ones).
The product of its (nonzero) digits is 2100, while the sum is 27.
The square root of 60125157 is about 7754.0413333951. The cubic root of 60125157 is about 391.7587823375.
The spelling of 60125157 in words is "sixty million, one hundred twenty-five thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •