Base | Representation |
---|---|
bin | 100111101101010… |
… | …1111101010001101 |
3 | 10102212011111022100 |
4 | 1033122233222031 |
5 | 10212044123041 |
6 | 340114105313 |
7 | 45006210144 |
oct | 11732575215 |
9 | 3385144270 |
10 | 1332411021 |
11 | 624125137 |
12 | 31227b239 |
13 | 1830754b6 |
14 | c8d5a75b |
15 | 7be936b6 |
hex | 4f6afa8d |
1332411021 has 12 divisors (see below), whose sum is σ = 1925183260. Its totient is φ = 888001920.
The previous prime is 1332410971. The next prime is 1332411053. The reversal of 1332411021 is 1201142331.
It can be written as a sum of positive squares in 2 ways, for example, as 478953225 + 853457796 = 21885^2 + 29214^2 .
It is not a de Polignac number, because 1332411021 - 26 = 1332410957 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1332410985 and 1332411003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1332413021) 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 in 11 ways as a sum of consecutive naturals, for example, 10965 + ... + 52773.
Almost surely, 21332411021 is an apocalyptic number.
It is an amenable number.
1332411021 is a deficient number, since it is larger than the sum of its proper divisors (592772239).
1332411021 is a wasteful number, since it uses less digits than its factorization.
1332411021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45356 (or 45353 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
The square root of 1332411021 is about 36502.2057004779. The cubic root of 1332411021 is about 1100.3885737399.
Adding to 1332411021 its reverse (1201142331), we get a palindrome (2533553352).
The spelling of 1332411021 in words is "one billion, three hundred thirty-two million, four hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •