Base | Representation |
---|---|
bin | 1001011001101010111… |
… | …11111011110100010001 |
3 | 1010212202211022211121022 |
4 | 10230311133323310101 |
5 | 20243021122023441 |
6 | 404220550005225 |
7 | 32223511433051 |
oct | 4546537736421 |
9 | 1125684284538 |
10 | 323020111121 |
11 | 114aa0482524 |
12 | 5272a946815 |
13 | 245cb10c936 |
14 | 118c4587561 |
15 | 860864284b |
hex | 4b357fbd11 |
323020111121 has 2 divisors, whose sum is σ = 323020111122. Its totient is φ = 323020111120.
The previous prime is 323020111093. The next prime is 323020111147. The reversal of 323020111121 is 121111020323.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 258333310225 + 64686800896 = 508265^2 + 254336^2 .
It is a cyclic number.
It is not a de Polignac number, because 323020111121 - 214 = 323020094737 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 323020111121.
It is not a weakly prime, because it can be changed into another prime (323020111721) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 161510055560 + 161510055561.
It is an arithmetic number, because the mean of its divisors is an integer number (161510055561).
Almost surely, 2323020111121 is an apocalyptic number.
It is an amenable number.
323020111121 is a deficient number, since it is larger than the sum of its proper divisors (1).
323020111121 is an equidigital number, since it uses as much as digits as its factorization.
323020111121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 323020111121 its reverse (121111020323), we get a palindrome (444131131444).
The spelling of 323020111121 in words is "three hundred twenty-three billion, twenty million, one hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •