Base | Representation |
---|---|
bin | 11011101111101000111010… |
… | …01101011100111110011100 |
3 | 22000000112202200100220001101 |
4 | 31313310131031130332130 |
5 | 30444044001112134000 |
6 | 333431500443122444 |
7 | 15564602035500220 |
oct | 1567643515347634 |
9 | 260015680326041 |
10 | 61010500505500 |
11 | 18492453aa4217 |
12 | 6a142b1213424 |
13 | 280735b4356a0 |
14 | 110ccd158a780 |
15 | 70c0530dee6a |
hex | 377d1d35cf9c |
61010500505500 has 96 divisors (see below), whose sum is σ = 163996225481088. Its totient is φ = 19308817728000.
The previous prime is 61010500505443. The next prime is 61010500505527. The reversal of 61010500505500 is 550500501016.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 670399561 + ... + 670490560.
It is an arithmetic number, because the mean of its divisors is an integer number (1708294015428).
Almost surely, 261010500505500 is an apocalyptic number.
It is an amenable number.
61010500505500 is an abundant number, since it is smaller than the sum of its proper divisors (102985724975588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61010500505500 is a wasteful number, since it uses less digits than its factorization.
61010500505500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1340890160 (or 1340890148 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 28.
The spelling of 61010500505500 in words is "sixty-one trillion, ten billion, five hundred million, five hundred five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •