Base | Representation |
---|---|
bin | 1100101011000… |
… | …10011011010100 |
3 | 21102001001222200 |
4 | 12111202123110 |
5 | 204203344312 |
6 | 14314324500 |
7 | 2430420513 |
oct | 625423324 |
9 | 242031880 |
10 | 106309332 |
11 | 55010858 |
12 | 2b729730 |
13 | 1904253c |
14 | 1019467a |
15 | 94ee0dc |
hex | 65626d4 |
106309332 has 36 divisors (see below), whose sum is σ = 282871680. Its totient is φ = 33571152.
The previous prime is 106309309. The next prime is 106309337. The reversal of 106309332 is 233903601.
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-2 number, since 2×1063093322 = 22603348140572448, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106309296 and 106309305.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106309337) 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, 77028 + ... + 78395.
Almost surely, 2106309332 is an apocalyptic number.
106309332 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
106309332 is an abundant number, since it is smaller than the sum of its proper divisors (176562348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106309332 is a wasteful number, since it uses less digits than its factorization.
106309332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155452 (or 155447 counting only the distinct ones).
The product of its (nonzero) digits is 2916, while the sum is 27.
The square root of 106309332 is about 10310.6416871114. The cubic root of 106309332 is about 473.7222642567.
The spelling of 106309332 in words is "one hundred six million, three hundred nine thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •