Base | Representation |
---|---|
bin | 10110110000101110000110… |
… | …010001011111011011100101 |
3 | 111010102221122102202212210100 |
4 | 112300232012101133123211 |
5 | 101110110123202000010 |
6 | 552523343322414313 |
7 | 30041231411150643 |
oct | 2660560621373345 |
9 | 433387572685710 |
10 | 100105055500005 |
11 | 29995352107256 |
12 | b289044661399 |
13 | 43b1b35146bba |
14 | 1aa1179460193 |
15 | b88e677752c0 |
hex | 5b0b8645f6e5 |
100105055500005 has 48 divisors (see below), whose sum is σ = 175969416055680. Its totient is φ = 52634376547200.
The previous prime is 100105055500003. The next prime is 100105055500049. The reversal of 100105055500005 is 500005550501001.
100105055500005 is a `hidden beast` number, since 1 + 0 + 0 + 105 + 0 + 5 + 550 + 0 + 0 + 0 + 5 = 666.
It is not a de Polignac number, because 100105055500005 - 21 = 100105055500003 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100105055500003) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 55280226 + ... + 57062364.
It is an arithmetic number, because the mean of its divisors is an integer number (3666029501160).
Almost surely, 2100105055500005 is an apocalyptic number.
100105055500005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
100105055500005 is a deficient number, since it is larger than the sum of its proper divisors (75864360555675).
100105055500005 is a wasteful number, since it uses less digits than its factorization.
100105055500005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1799802 (or 1799799 counting only the distinct ones).
The product of its (nonzero) digits is 3125, while the sum is 27.
The spelling of 100105055500005 in words is "one hundred trillion, one hundred five billion, fifty-five million, five hundred thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •