Base | Representation |
---|---|
bin | 111000110110110111… |
… | …010011010100111001 |
3 | 12211120200100210011100 |
4 | 320312313103110321 |
5 | 2000012300241024 |
6 | 44013533322013 |
7 | 4260606341052 |
oct | 706667232471 |
9 | 184520323140 |
10 | 61050008889 |
11 | 23989158301 |
12 | b9b9636309 |
13 | 59ac15681c |
14 | 2d520db729 |
15 | 18c4a117c9 |
hex | e36dd3539 |
61050008889 has 9 divisors (see below), whose sum is σ = 88184416879. Its totient is φ = 40699511760.
The previous prime is 61050008869. The next prime is 61050008891. The reversal of 61050008889 is 98880005016.
The square root of 61050008889 is 247083.
It is a perfect power (a square), and thus also a powerful number.
61050008889 is a `hidden beast` number, since 61 + 0 + 500 + 0 + 8 + 8 + 89 = 666.
It can be written as a sum of positive squares in only one way, i.e., 35000048889 + 26049960000 = 187083^2 + 161400^2 .
It is a tau number, because it is divible by the number of its divisors (9).
It is not a de Polignac number, because 61050008889 - 217 = 61049877817 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (61050008819) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 700069 + ... + 782429.
Almost surely, 261050008889 is an apocalyptic number.
61050008889 is the 247083-rd square number.
61050008889 is the 123542-nd centered octagonal number.
It is an amenable number.
61050008889 is a deficient number, since it is larger than the sum of its proper divisors (27134407990).
61050008889 is an frugal number, since it uses more digits than its factorization.
61050008889 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164728 (or 82364 counting only the distinct ones).
The product of its (nonzero) digits is 138240, while the sum is 45.
The spelling of 61050008889 in words is "sixty-one billion, fifty million, eight thousand, eight hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •