Base | Representation |
---|---|
bin | 111100111000000… |
… | …100101010010001 |
3 | 2122011211001021022 |
4 | 330320010222101 |
5 | 4042430111423 |
6 | 245202405225 |
7 | 34211115434 |
oct | 7470045221 |
9 | 2564731238 |
10 | 1021332113 |
11 | 484573a2a |
12 | 246060815 |
13 | 133798a39 |
14 | 9990181b |
15 | 5e9e6dc8 |
hex | 3ce04a91 |
1021332113 has 2 divisors, whose sum is σ = 1021332114. Its totient is φ = 1021332112.
The previous prime is 1021332079. The next prime is 1021332133. The reversal of 1021332113 is 3112331201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 604028929 + 417303184 = 24577^2 + 20428^2 .
It is a cyclic number.
It is not a de Polignac number, because 1021332113 - 212 = 1021328017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1021332091 and 1021332100.
It is not a weakly prime, because it can be changed into another prime (1021332133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 510666056 + 510666057.
It is an arithmetic number, because the mean of its divisors is an integer number (510666057).
Almost surely, 21021332113 is an apocalyptic number.
It is an amenable number.
1021332113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1021332113 is an equidigital number, since it uses as much as digits as its factorization.
1021332113 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 1021332113 is about 31958.2870786280. The cubic root of 1021332113 is about 1007.0607330470.
Adding to 1021332113 its reverse (3112331201), we get a palindrome (4133663314).
The spelling of 1021332113 in words is "one billion, twenty-one million, three hundred thirty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •