Base | Representation |
---|---|
bin | 100111101100110… |
… | …0101000000001101 |
3 | 10102211120221211201 |
4 | 1033121211000031 |
5 | 10212004331404 |
6 | 340103345501 |
7 | 45003464500 |
oct | 11731450015 |
9 | 3384527751 |
10 | 1332105229 |
11 | 623a36414 |
12 | 312152291 |
13 | 182c99260 |
14 | c8cbb137 |
15 | 7be32ca4 |
hex | 4f66500d |
1332105229 has 24 divisors (see below), whose sum is σ = 1673198520. Its totient is φ = 1051190784.
The previous prime is 1332105217. The next prime is 1332105253. The reversal of 1332105229 is 9225012331.
It can be written as a sum of positive squares in 4 ways, for example, as 12744900 + 1319360329 = 3570^2 + 36323^2 .
It is not a de Polignac number, because 1332105229 - 27 = 1332105101 is a prime.
It is a super-2 number, since 2×13321052292 = 3549008682258284882, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1332105197 and 1332105206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1332105209) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 257977 + ... + 263089.
It is an arithmetic number, because the mean of its divisors is an integer number (69716605).
Almost surely, 21332105229 is an apocalyptic number.
It is an amenable number.
1332105229 is a deficient number, since it is larger than the sum of its proper divisors (341093291).
1332105229 is a wasteful number, since it uses less digits than its factorization.
1332105229 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5549 (or 5542 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 28.
The square root of 1332105229 is about 36498.0167817376. The cubic root of 1332105229 is about 1100.3043865628.
The spelling of 1332105229 in words is "one billion, three hundred thirty-two million, one hundred five thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •