Base | Representation |
---|---|
bin | 10011110010111… |
… | …110011100111101 |
3 | 212010221221212011 |
4 | 103302332130331 |
5 | 1140011130414 |
6 | 52542411221 |
7 | 11142026233 |
oct | 2362763475 |
9 | 763857764 |
10 | 332130109 |
11 | 16052a2a3 |
12 | 93290b11 |
13 | 53a6a4bc |
14 | 32178953 |
15 | 1e258dc4 |
hex | 13cbe73d |
332130109 has 2 divisors, whose sum is σ = 332130110. Its totient is φ = 332130108.
The previous prime is 332130103. The next prime is 332130137. The reversal of 332130109 is 901031233.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 237067609 + 95062500 = 15397^2 + 9750^2 .
It is a cyclic number.
It is not a de Polignac number, because 332130109 - 211 = 332128061 is a prime.
It is a super-2 number, since 2×3321301092 = 220620818608703762, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 332130109.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (332130103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 166065054 + 166065055.
It is an arithmetic number, because the mean of its divisors is an integer number (166065055).
Almost surely, 2332130109 is an apocalyptic number.
It is an amenable number.
332130109 is a deficient number, since it is larger than the sum of its proper divisors (1).
332130109 is an equidigital number, since it uses as much as digits as its factorization.
332130109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 22.
The square root of 332130109 is about 18224.4371380847. The cubic root of 332130109 is about 692.5259993627.
The spelling of 332130109 in words is "three hundred thirty-two million, one hundred thirty thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •