Base | Representation |
---|---|
bin | 10111111000101011011111… |
… | …111001100111111001101100 |
3 | 111202221200120202110221021122 |
4 | 113320223133321213321230 |
5 | 102232120014014103010 |
6 | 1011231200115120112 |
7 | 31061421402435530 |
oct | 2770533771477154 |
9 | 452850522427248 |
10 | 105050066550380 |
11 | 30521534a10aa6 |
12 | b9474a68a3038 |
13 | 46802429ab543 |
14 | 1bd2643a8dbc0 |
15 | c228d762e855 |
hex | 5f8adfe67e6c |
105050066550380 has 24 divisors (see below), whose sum is σ = 252120159721248. Its totient is φ = 36017165674368.
The previous prime is 105050066550337. The next prime is 105050066550397. The reversal of 105050066550380 is 83055660050501.
It is a super-2 number, since 2×1050500665503802 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 375178808969 + ... + 375178809248.
It is an arithmetic number, because the mean of its divisors is an integer number (10505006655052).
Almost surely, 2105050066550380 is an apocalyptic number.
105050066550380 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
105050066550380 is an abundant number, since it is smaller than the sum of its proper divisors (147070093170868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105050066550380 is a wasteful number, since it uses less digits than its factorization.
105050066550380 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 750357618233 (or 750357618231 counting only the distinct ones).
The product of its (nonzero) digits is 540000, while the sum is 44.
The spelling of 105050066550380 in words is "one hundred five trillion, fifty billion, sixty-six million, five hundred fifty thousand, three hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •