Base | Representation |
---|---|
bin | 1100110000001… |
… | …01010000000000 |
3 | 21110021221211120 |
4 | 12120011100000 |
5 | 204341220011 |
6 | 14340512240 |
7 | 2436166062 |
oct | 630052000 |
9 | 243257746 |
10 | 106976256 |
11 | 55426932 |
12 | 2b9ab680 |
13 | 19216c7a |
14 | 102c9732 |
15 | 95d1a06 |
hex | 6605400 |
106976256 has 88 divisors (see below), whose sum is σ = 288872640. Its totient is φ = 35192832.
The previous prime is 106976237. The next prime is 106976281. The reversal of 106976256 is 652679601.
It is a super-2 number, since 2×1069762562 = 22887838695555072, which 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 (7) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 297805 + ... + 298163.
Almost surely, 2106976256 is an apocalyptic number.
106976256 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 106976256, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (144436320).
106976256 is an abundant number, since it is smaller than the sum of its proper divisors (181896384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106976256 is an equidigital number, since it uses as much as digits as its factorization.
106976256 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 479 (or 461 counting only the distinct ones).
The product of its (nonzero) digits is 136080, while the sum is 42.
The square root of 106976256 is about 10342.9326595507. The cubic root of 106976256 is about 474.7108208445.
The spelling of 106976256 in words is "one hundred six million, nine hundred seventy-six thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •