Base | Representation |
---|---|
bin | 10111111000101011011111… |
… | …111001100111110100001110 |
3 | 111202221200120202110220210200 |
4 | 113320223133321213310032 |
5 | 102232120014014100110 |
6 | 1011231200115114330 |
7 | 31061421402434520 |
oct | 2770533771476416 |
9 | 452850522426720 |
10 | 105050066550030 |
11 | 30521534a10808 |
12 | b9474a68a29a6 |
13 | 46802429ab334 |
14 | 1bd2643a8da10 |
15 | c228d762e6c0 |
hex | 5f8adfe67d0e |
105050066550030 has 96 divisors (see below), whose sum is σ = 315909597878784. Its totient is φ = 23722149267648.
The previous prime is 105050066549873. The next prime is 105050066550047. The reversal of 105050066550030 is 30055660050501.
105050066550030 is a `hidden beast` number, since 1 + 0 + 50 + 50 + 0 + 6 + 6 + 550 + 0 + 3 + 0 = 666.
It is a super-2 number, since 2×1050500665500302 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1004442514 + ... + 1004547093.
It is an arithmetic number, because the mean of its divisors is an integer number (3290724977904).
Almost surely, 2105050066550030 is an apocalyptic number.
105050066550030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105050066550030 is an abundant number, since it is smaller than the sum of its proper divisors (210859531328754).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105050066550030 is a wasteful number, since it uses less digits than its factorization.
105050066550030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2008989710 (or 2008989707 counting only the distinct ones).
The product of its (nonzero) digits is 67500, while the sum is 36.
The spelling of 105050066550030 in words is "one hundred five trillion, fifty billion, sixty-six million, five hundred fifty thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •