Base | Representation |
---|---|
bin | 10000011110011101000… |
… | …010010101000011111001 |
3 | 11000020102201210202020112 |
4 | 100132131002111003321 |
5 | 122022232011013223 |
6 | 2224044111434105 |
7 | 144541146661514 |
oct | 20363502250371 |
9 | 4006381722215 |
10 | 1132211032313 |
11 | 3a719367a359 |
12 | 16351b225935 |
13 | 829c82653ca |
14 | 3cb29421d7b |
15 | 1e6b8775778 |
hex | 1079d0950f9 |
1132211032313 has 2 divisors, whose sum is σ = 1132211032314. Its totient is φ = 1132211032312.
The previous prime is 1132211032261. The next prime is 1132211032363. The reversal of 1132211032313 is 3132301122311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 980638633984 + 151572398329 = 990272^2 + 389323^2 .
It is a cyclic number.
It is not a de Polignac number, because 1132211032313 - 224 = 1132194255097 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1132211032363) 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 as a sum of consecutive naturals, namely, 566105516156 + 566105516157.
It is an arithmetic number, because the mean of its divisors is an integer number (566105516157).
Almost surely, 21132211032313 is an apocalyptic number.
It is an amenable number.
1132211032313 is a deficient number, since it is larger than the sum of its proper divisors (1).
1132211032313 is an equidigital number, since it uses as much as digits as its factorization.
1132211032313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 1132211032313 its reverse (3132301122311), we get a palindrome (4264512154624).
The spelling of 1132211032313 in words is "one trillion, one hundred thirty-two billion, two hundred eleven million, thirty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •