Base | Representation |
---|---|
bin | 10110110110100011100001… |
… | …000101101111011100111000 |
3 | 111011212021120201111000111201 |
4 | 112312203201011233130320 |
5 | 101133142302320330310 |
6 | 553431454000503544 |
7 | 30112214435441410 |
oct | 2666434105573470 |
9 | 434767521430451 |
10 | 100506011105080 |
11 | 2a02a3a609a909 |
12 | b3328a391abb4 |
13 | 44108a374a319 |
14 | 1ab67344d5640 |
15 | b945d2ed0e3a |
hex | 5b68e116f738 |
100506011105080 has 64 divisors (see below), whose sum is σ = 258828046914240. Its totient is φ = 34408001359872.
The previous prime is 100506011105077. The next prime is 100506011105089. The reversal of 100506011105080 is 80501110605001.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100506011105089) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 266490639 + ... + 266867518.
It is an arithmetic number, because the mean of its divisors is an integer number (4044188233035).
Almost surely, 2100506011105080 is an apocalyptic number.
100506011105080 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100506011105080 is an abundant number, since it is smaller than the sum of its proper divisors (158322035809160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100506011105080 is a wasteful number, since it uses less digits than its factorization.
100506011105080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 533358848 (or 533358844 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 28.
The spelling of 100506011105080 in words is "one hundred trillion, five hundred six billion, eleven million, one hundred five thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •