Base | Representation |
---|---|
bin | 1100101010101… |
… | …00101110110000 |
3 | 21101221020000220 |
4 | 12111110232300 |
5 | 204200100412 |
6 | 14313213040 |
7 | 2430065121 |
oct | 625245660 |
9 | 241836026 |
10 | 106253232 |
11 | 54a82698 |
12 | 2b701180 |
13 | 19022b47 |
14 | 1017c048 |
15 | 94dc68c |
hex | 6554bb0 |
106253232 has 20 divisors (see below), whose sum is σ = 274487640. Its totient is φ = 35417728.
The previous prime is 106253221. The next prime is 106253237. The reversal of 106253232 is 232352601.
It is a super-2 number, since 2×1062532322 = 22579498620891648, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (106253237) 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 3 ways as a sum of consecutive naturals, for example, 1106757 + ... + 1106852.
It is an arithmetic number, because the mean of its divisors is an integer number (13724382).
Almost surely, 2106253232 is an apocalyptic number.
106253232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
106253232 is an abundant number, since it is smaller than the sum of its proper divisors (168234408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106253232 is a wasteful number, since it uses less digits than its factorization.
106253232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2213620 (or 2213614 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 24.
The square root of 106253232 is about 10307.9208378800. The cubic root of 106253232 is about 473.6389210085.
The spelling of 106253232 in words is "one hundred six million, two hundred fifty-three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •