Base | Representation |
---|---|
bin | 10011001110011101110… |
… | …010011010111010100111 |
3 | 11200022020212000211011101 |
4 | 103032131302122322213 |
5 | 133121310230401411 |
6 | 2450541340220531 |
7 | 164311423256254 |
oct | 23163562327247 |
9 | 4608225024141 |
10 | 1321202200231 |
11 | 46a356220021 |
12 | 194083b3a747 |
13 | 97786886b54 |
14 | 47d373b442b |
15 | 2457a4b38c1 |
hex | 1339dc9aea7 |
1321202200231 has 2 divisors, whose sum is σ = 1321202200232. Its totient is φ = 1321202200230.
The previous prime is 1321202200169. The next prime is 1321202200259. The reversal of 1321202200231 is 1320022021231.
It is a strong prime.
It is an emirp because it is prime and its reverse (1320022021231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1321202200231 - 27 = 1321202200103 is a prime.
It is a super-2 number, since 2×13212022002312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1321202200199 and 1321202200208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1321202200291) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 660601100115 + 660601100116.
It is an arithmetic number, because the mean of its divisors is an integer number (660601100116).
Almost surely, 21321202200231 is an apocalyptic number.
1321202200231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1321202200231 is an equidigital number, since it uses as much as digits as its factorization.
1321202200231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 1321202200231 its reverse (1320022021231), we get a palindrome (2641224221462).
The spelling of 1321202200231 in words is "one trillion, three hundred twenty-one billion, two hundred two million, two hundred thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •