Base | Representation |
---|---|
bin | 100111101001011… |
… | …0100001001000111 |
3 | 10102201020212202010 |
4 | 1033102310021013 |
5 | 10211031112411 |
6 | 340001345303 |
7 | 44652431424 |
oct | 11722641107 |
9 | 3381225663 |
10 | 1330332231 |
11 | 622a35328 |
12 | 311638233 |
13 | 1827c8247 |
14 | c8978d4b |
15 | 7bbd27a6 |
hex | 4f4b4247 |
1330332231 has 4 divisors (see below), whose sum is σ = 1773776312. Its totient is φ = 886888152.
The previous prime is 1330332221. The next prime is 1330332287. The reversal of 1330332231 is 1322330331.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 1330332231 - 218 = 1330070087 is a prime.
It is a super-2 number, since 2×13303322312 = 3539567689674874722, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1330332198 and 1330332207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1330332221) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 221722036 + ... + 221722041.
It is an arithmetic number, because the mean of its divisors is an integer number (443444078).
Almost surely, 21330332231 is an apocalyptic number.
1330332231 is a deficient number, since it is larger than the sum of its proper divisors (443444081).
1330332231 is an equidigital number, since it uses as much as digits as its factorization.
1330332231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 443444080.
The product of its (nonzero) digits is 972, while the sum is 21.
The square root of 1330332231 is about 36473.7197307870. The cubic root of 1330332231 is about 1099.8160108250.
Adding to 1330332231 its reverse (1322330331), we get a palindrome (2652662562).
The spelling of 1330332231 in words is "one billion, three hundred thirty million, three hundred thirty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •