Base | Representation |
---|---|
bin | 1010010010111111001000… |
… | …1100101010100010100111 |
3 | 1111002022021000111011200201 |
4 | 2210233302030222202213 |
5 | 2440442011332344312 |
6 | 40024533501251331 |
7 | 2245636265115223 |
oct | 244576214524247 |
9 | 44068230434621 |
10 | 11321302231207 |
11 | 3675378a66871 |
12 | 132a189263b47 |
13 | 641795666ca7 |
14 | 2b1d4d901783 |
15 | 14975e0b5557 |
hex | a4bf232a8a7 |
11321302231207 has 2 divisors, whose sum is σ = 11321302231208. Its totient is φ = 11321302231206.
The previous prime is 11321302231201. The next prime is 11321302231223. The reversal of 11321302231207 is 70213220312311.
11321302231207 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is an emirp because it is prime and its reverse (70213220312311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11321302231207 - 239 = 10771546417319 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11321302231201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5660651115603 + 5660651115604.
It is an arithmetic number, because the mean of its divisors is an integer number (5660651115604).
Almost surely, 211321302231207 is an apocalyptic number.
11321302231207 is a deficient number, since it is larger than the sum of its proper divisors (1).
11321302231207 is an equidigital number, since it uses as much as digits as its factorization.
11321302231207 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3024, while the sum is 28.
Adding to 11321302231207 its reverse (70213220312311), we get a palindrome (81534522543518).
The spelling of 11321302231207 in words is "eleven trillion, three hundred twenty-one billion, three hundred two million, two hundred thirty-one thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •