Base | Representation |
---|---|
bin | 110111111011100011… |
… | …110101100100110101 |
3 | 12202000100011122220110 |
4 | 313323203311210311 |
5 | 1440443043104144 |
6 | 43331112053233 |
7 | 4224135335634 |
oct | 677343654465 |
9 | 182010148813 |
10 | 60055050549 |
11 | 2351856838a |
12 | b780394219 |
13 | 5880c93390 |
14 | 2c99d0351b |
15 | 18674c90b9 |
hex | dfb8f5935 |
60055050549 has 8 divisors (see below), whose sum is σ = 86232893152. Its totient is φ = 36956954160.
The previous prime is 60055050547. The next prime is 60055050637. The reversal of 60055050549 is 94505055006.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 60055050549 - 21 = 60055050547 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39), and also a Moran number because the ratio is a prime number: 1539873091 = 60055050549 / (6 + 0 + 0 + 5 + 5 + 0 + 5 + 0 + 5 + 4 + 9).
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (60055050547) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 769936507 + ... + 769936584.
It is an arithmetic number, because the mean of its divisors is an integer number (10779111644).
Almost surely, 260055050549 is an apocalyptic number.
It is an amenable number.
60055050549 is a deficient number, since it is larger than the sum of its proper divisors (26177842603).
60055050549 is a wasteful number, since it uses less digits than its factorization.
60055050549 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1539873107.
The product of its (nonzero) digits is 135000, while the sum is 39.
The spelling of 60055050549 in words is "sixty billion, fifty-five million, fifty thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •