Base | Representation |
---|---|
bin | 110001010111011011… |
… | …1001001111000000000 |
3 | 101010122012222202211010 |
4 | 1202232313021320000 |
5 | 3214103301042211 |
6 | 120411320320520 |
7 | 10442045600415 |
oct | 1425667117000 |
9 | 333565882733 |
10 | 106012909056 |
11 | 40a6158372a |
12 | 18667613140 |
13 | 9cc64781b2 |
14 | 51b987010c |
15 | 2b570724a6 |
hex | 18aedc9e00 |
106012909056 has 80 divisors (see below), whose sum is σ = 282668992848. Its totient is φ = 35307110400.
The previous prime is 106012909049. The next prime is 106012909087. The reversal of 106012909056 is 650909210601.
It is a super-2 number, since 2×1060129090562 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1784796 + ... + 1843236.
Almost surely, 2106012909056 is an apocalyptic number.
106012909056 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 106012909056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (141334496424).
106012909056 is an abundant number, since it is smaller than the sum of its proper divisors (176656083792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106012909056 is an equidigital number, since it uses as much as digits as its factorization.
106012909056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59643 (or 59627 counting only the distinct ones).
The product of its (nonzero) digits is 29160, while the sum is 39.
The spelling of 106012909056 in words is "one hundred six billion, twelve million, nine hundred nine thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •