Base | Representation |
---|---|
bin | 100111101011010… |
… | …0000111011101001 |
3 | 10102210002011011222 |
4 | 1033112200323221 |
5 | 10211303131441 |
6 | 340034231425 |
7 | 44663611202 |
oct | 11726407351 |
9 | 3383064158 |
10 | 1331302121 |
11 | 623537a96 |
12 | 311a25575 |
13 | 182a77846 |
14 | c8b4c5a9 |
15 | 7bd24d4b |
hex | 4f5a0ee9 |
1331302121 has 2 divisors, whose sum is σ = 1331302122. Its totient is φ = 1331302120.
The previous prime is 1331302117. The next prime is 1331302153. The reversal of 1331302121 is 1212031331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1264798096 + 66504025 = 35564^2 + 8155^2 .
It is a cyclic number.
It is not a de Polignac number, because 1331302121 - 22 = 1331302117 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1331302121.
It is not a weakly prime, because it can be changed into another prime (1331302111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 665651060 + 665651061.
It is an arithmetic number, because the mean of its divisors is an integer number (665651061).
Almost surely, 21331302121 is an apocalyptic number.
It is an amenable number.
1331302121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1331302121 is an equidigital number, since it uses as much as digits as its factorization.
1331302121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 1331302121 is about 36487.0130457400. The cubic root of 1331302121 is about 1100.0832226291.
Adding to 1331302121 its reverse (1212031331), we get a palindrome (2543333452).
The spelling of 1331302121 in words is "one billion, three hundred thirty-one million, three hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •