Base | Representation |
---|---|
bin | 10110110000101110100000… |
… | …110011000100101101001010 |
3 | 111010102222210110010210011220 |
4 | 112300232200303010231022 |
5 | 101110112031112323200 |
6 | 552523455420502510 |
7 | 30041245423531146 |
oct | 2660564063045512 |
9 | 433388713123156 |
10 | 100105500511050 |
11 | 29995560325681 |
12 | b2891496aaa36 |
13 | 43b1ba63b7b48 |
14 | 1aa11bc5c0226 |
15 | b88e9187a4a0 |
hex | 5b0ba0cc4b4a |
100105500511050 has 24 divisors (see below), whose sum is σ = 248261641267776. Its totient is φ = 26694800136240.
The previous prime is 100105500510973. The next prime is 100105500511069. The reversal of 100105500511050 is 50115005501001.
It is a super-2 number, since 2×1001055005110502 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 100105500511050.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 333685001554 + ... + 333685001853.
It is an arithmetic number, because the mean of its divisors is an integer number (10344235052824).
Almost surely, 2100105500511050 is an apocalyptic number.
100105500511050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100105500511050 is an abundant number, since it is smaller than the sum of its proper divisors (148156140756726).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100105500511050 is a wasteful number, since it uses less digits than its factorization.
100105500511050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 667370003422 (or 667370003417 counting only the distinct ones).
The product of its (nonzero) digits is 625, while the sum is 24.
The spelling of 100105500511050 in words is "one hundred trillion, one hundred five billion, five hundred million, five hundred eleven thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •