Base | Representation |
---|---|
bin | 111000110101100011… |
… | …110000001001101010 |
3 | 12211112011011001020000 |
4 | 320311203300021222 |
5 | 1444441143404413 |
6 | 44011432043430 |
7 | 4260222230535 |
oct | 706543601152 |
9 | 184464131200 |
10 | 61028106858 |
11 | 23977858a54 |
12 | b9b2233576 |
13 | 59a7758744 |
14 | 2d4d239a1c |
15 | 18c2b37073 |
hex | e358f026a |
61028106858 has 80 divisors (see below), whose sum is σ = 138067079040. Its totient is φ = 20147206464.
The previous prime is 61028106823. The next prime is 61028106859. The reversal of 61028106858 is 85860182016.
61028106858 is a `hidden beast` number, since 610 + 28 + 1 + 0 + 6 + 8 + 5 + 8 = 666.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (61028106859) 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 39 ways as a sum of consecutive naturals, for example, 10272853 + ... + 10278791.
It is an arithmetic number, because the mean of its divisors is an integer number (1725838488).
Almost surely, 261028106858 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 61028106858, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (69033539520).
61028106858 is an abundant number, since it is smaller than the sum of its proper divisors (77038972182).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61028106858 is a wasteful number, since it uses less digits than its factorization.
61028106858 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6553 (or 6544 counting only the distinct ones).
The product of its (nonzero) digits is 184320, while the sum is 45.
The spelling of 61028106858 in words is "sixty-one billion, twenty-eight million, one hundred six thousand, eight hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •