Base | Representation |
---|---|
bin | 10011001110010010011… |
… | …001011110100110101001 |
3 | 11200021202112110112212212 |
4 | 103032102121132212221 |
5 | 133120412321043421 |
6 | 2450510352414505 |
7 | 164303613120623 |
oct | 23162231364651 |
9 | 4607675415785 |
10 | 1321011112361 |
11 | 46a268374966 |
12 | 19402bb47435 |
13 | 977561001c5 |
14 | 47d19c71c13 |
15 | 24568819e5b |
hex | 1339265e9a9 |
1321011112361 has 2 divisors, whose sum is σ = 1321011112362. Its totient is φ = 1321011112360.
The previous prime is 1321011112349. The next prime is 1321011112381. The reversal of 1321011112361 is 1632111101231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1282626465961 + 38384646400 = 1132531^2 + 195920^2 .
It is a cyclic number.
It is not a de Polignac number, because 1321011112361 - 222 = 1321006918057 is a prime.
It is not a weakly prime, because it can be changed into another prime (1321011112381) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 660505556180 + 660505556181.
It is an arithmetic number, because the mean of its divisors is an integer number (660505556181).
Almost surely, 21321011112361 is an apocalyptic number.
It is an amenable number.
1321011112361 is a deficient number, since it is larger than the sum of its proper divisors (1).
1321011112361 is an equidigital number, since it uses as much as digits as its factorization.
1321011112361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 23.
Adding to 1321011112361 its reverse (1632111101231), we get a palindrome (2953122213592).
The spelling of 1321011112361 in words is "one trillion, three hundred twenty-one billion, eleven million, one hundred twelve thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •