Base | Representation |
---|---|
bin | 1010010011000110101010… |
… | …0110101100110011001001 |
3 | 1111002111110210122102110201 |
4 | 2210301222212230303021 |
5 | 2441010131003301441 |
6 | 40025510143012201 |
7 | 2246040324445135 |
oct | 244615246546311 |
9 | 44074423572421 |
10 | 11323322322121 |
11 | 3676215285a97 |
12 | 132a65189a061 |
13 | 641a28026c64 |
14 | 2b20a1d0a3c5 |
15 | 14982b5e5c31 |
hex | a4c6a9accc9 |
11323322322121 has 2 divisors, whose sum is σ = 11323322322122. Its totient is φ = 11323322322120.
The previous prime is 11323322322097. The next prime is 11323322322139. The reversal of 11323322322121 is 12122322332311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10130725094400 + 1192597227721 = 3182880^2 + 1092061^2 .
It is a cyclic number.
It is not a de Polignac number, because 11323322322121 - 25 = 11323322322089 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11323322322121.
It is not a weakly prime, because it can be changed into another prime (11323322722121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5661661161060 + 5661661161061.
It is an arithmetic number, because the mean of its divisors is an integer number (5661661161061).
Almost surely, 211323322322121 is an apocalyptic number.
It is an amenable number.
11323322322121 is a deficient number, since it is larger than the sum of its proper divisors (1).
11323322322121 is an equidigital number, since it uses as much as digits as its factorization.
11323322322121 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5184, while the sum is 28.
Adding to 11323322322121 its reverse (12122322332311), we get a palindrome (23445644654432).
The spelling of 11323322322121 in words is "eleven trillion, three hundred twenty-three billion, three hundred twenty-two million, three hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •