Base | Representation |
---|---|
bin | 1010000010000110111000… |
… | …0011000011100100100111 |
3 | 1110001120202211002221022012 |
4 | 2200201232003003210213 |
5 | 2421214122002422301 |
6 | 35243415225224435 |
7 | 2215662310345205 |
oct | 240415603034447 |
9 | 43046684087265 |
10 | 11031322310951 |
11 | 35733a2949808 |
12 | 12a1b3b63211b |
13 | 620331736367 |
14 | 2a1cc146c075 |
15 | 141e3b42debb |
hex | a086e0c3927 |
11031322310951 has 2 divisors, whose sum is σ = 11031322310952. Its totient is φ = 11031322310950.
The previous prime is 11031322310941. The next prime is 11031322311001. The reversal of 11031322310951 is 15901322313011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11031322310951 - 214 = 11031322294567 is a prime.
It is a super-2 number, since 2×110313223109512 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11031322310941) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5515661155475 + 5515661155476.
It is an arithmetic number, because the mean of its divisors is an integer number (5515661155476).
Almost surely, 211031322310951 is an apocalyptic number.
11031322310951 is a deficient number, since it is larger than the sum of its proper divisors (1).
11031322310951 is an equidigital number, since it uses as much as digits as its factorization.
11031322310951 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4860, while the sum is 32.
Adding to 11031322310951 its reverse (15901322313011), we get a palindrome (26932644623962).
The spelling of 11031322310951 in words is "eleven trillion, thirty-one billion, three hundred twenty-two million, three hundred ten thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •