Base | Representation |
---|---|
bin | 1100101010011… |
… | …01110110100000 |
3 | 21101212210101100 |
4 | 12111031312200 |
5 | 204143200211 |
6 | 14312434400 |
7 | 2426620020 |
oct | 625156640 |
9 | 241783340 |
10 | 106225056 |
11 | 54a63503 |
12 | 2b6a8a00 |
13 | 19013082 |
14 | 10171a80 |
15 | 94d4156 |
hex | 654dda0 |
106225056 has 72 divisors (see below), whose sum is σ = 345237984. Its totient is φ = 30349440.
The previous prime is 106225043. The next prime is 106225073. The reversal of 106225056 is 650522601.
It is a tau number, because it is divible by the number of its divisors (72).
It is a super-2 number, since 2×1062250562 = 22567525044406272, which contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 24330 + ... + 28361.
It is an arithmetic number, because the mean of its divisors is an integer number (4794972).
Almost surely, 2106225056 is an apocalyptic number.
106225056 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
106225056 is an abundant number, since it is smaller than the sum of its proper divisors (239012928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106225056 is a wasteful number, since it uses less digits than its factorization.
106225056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52714 (or 52703 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
The square root of 106225056 is about 10306.5540312948. The cubic root of 106225056 is about 473.5970511291.
Adding to 106225056 its reverse (650522601), we get a palindrome (756747657).
The spelling of 106225056 in words is "one hundred six million, two hundred twenty-five thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •