Base | Representation |
---|---|
bin | 11000000000110101111101… |
… | …001011110110101101000100 |
3 | 111211221022120201212210211000 |
4 | 120000311331023312231010 |
5 | 102320312413040212441 |
6 | 1012341014101013300 |
7 | 31150101204436650 |
oct | 3000657513665504 |
9 | 454838521783730 |
10 | 105611051100996 |
11 | 30718439087a51 |
12 | ba181673b4230 |
13 | 46c110554460c |
14 | 1c11860411a60 |
15 | c322bc1442b6 |
hex | 600d7d2f6b44 |
105611051100996 has 96 divisors (see below), whose sum is σ = 312923312916480. Its totient is φ = 30174424026912.
The previous prime is 105611051100949. The next prime is 105611051101001. The reversal of 105611051100996 is 699001150116501.
105611051100996 is a `hidden beast` number, since 10 + 5 + 6 + 110 + 511 + 0 + 0 + 9 + 9 + 6 = 666.
It is a super-2 number, since 2×1056110511009962 (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 (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 260226385 + ... + 260631911.
It is an arithmetic number, because the mean of its divisors is an integer number (3259617842880).
Almost surely, 2105611051100996 is an apocalyptic number.
It is an amenable number.
105611051100996 is an abundant number, since it is smaller than the sum of its proper divisors (207312261815484).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105611051100996 is a wasteful number, since it uses less digits than its factorization.
105611051100996 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 750030 (or 750022 counting only the distinct ones).
The product of its (nonzero) digits is 72900, while the sum is 45.
The spelling of 105611051100996 in words is "one hundred five trillion, six hundred eleven billion, fifty-one million, one hundred thousand, nine hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •