Base | Representation |
---|---|
bin | 11000001000101101010110… |
… | …000111110010000001001100 |
3 | 111220211222201211202011001021 |
4 | 120020231112013302001030 |
5 | 102403141344232213400 |
6 | 1013433204300523524 |
7 | 31234124440045531 |
oct | 3010552607620114 |
9 | 456758654664037 |
10 | 106151561601100 |
11 | 309066961817a4 |
12 | baa4a732505a4 |
13 | 47300844350c2 |
14 | 1c2da9792cd88 |
15 | c413a449d71a |
hex | 608b561f204c |
106151561601100 has 72 divisors (see below), whose sum is σ = 238396989272400. Its totient is φ = 40978394553600.
The previous prime is 106151561601049. The next prime is 106151561601193. The reversal of 106151561601100 is 1106165151601.
It is a super-2 number, since 2×1061515616011002 (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 (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1486006 + ... + 14646205.
It is an arithmetic number, because the mean of its divisors is an integer number (3311069295450).
Almost surely, 2106151561601100 is an apocalyptic number.
106151561601100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106151561601100 is an abundant number, since it is smaller than the sum of its proper divisors (132245427671300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106151561601100 is a wasteful number, since it uses less digits than its factorization.
106151561601100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16134523 (or 16134516 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 34.
The spelling of 106151561601100 in words is "one hundred six trillion, one hundred fifty-one billion, five hundred sixty-one million, six hundred one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •