Base | Representation |
---|---|
bin | 1100101010110… |
… | …11011000110000 |
3 | 21101222121102200 |
4 | 12111123120300 |
5 | 204201433441 |
6 | 14313543200 |
7 | 2430240450 |
oct | 625333060 |
9 | 241877380 |
10 | 106280496 |
11 | 54aa1123 |
12 | 2b714b00 |
13 | 1903238a |
14 | 10187d60 |
15 | 94e57b6 |
hex | 655b630 |
106280496 has 60 divisors (see below), whose sum is σ = 339932112. Its totient is φ = 30365568.
The previous prime is 106280479. The next prime is 106280497. The reversal of 106280496 is 694082601.
It is a super-2 number, since 2×1062804962 = 22591087660012032, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 106280496.
It is not an unprimeable number, because it can be changed into a prime (106280497) by changing a digit.
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, 51711 + ... + 53726.
Almost surely, 2106280496 is an apocalyptic number.
106280496 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
106280496 is an abundant number, since it is smaller than the sum of its proper divisors (233651616).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106280496 is a wasteful number, since it uses less digits than its factorization.
106280496 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105458 (or 105449 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 36.
The square root of 106280496 is about 10309.2432311979. The cubic root of 106280496 is about 473.6794285989.
The spelling of 106280496 in words is "one hundred six million, two hundred eighty thousand, four hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •