Base | Representation |
---|---|
bin | 1010010100110001111100… |
… | …0101100011000000010001 |
3 | 1111012020210202202200101111 |
4 | 2211030133011203000101 |
5 | 2441443120222023441 |
6 | 40051031511333321 |
7 | 2251110055556506 |
oct | 245143705430021 |
9 | 44166722680344 |
10 | 11352120111121 |
11 | 3687452943109 |
12 | 133414a081241 |
13 | 6446673023aa |
14 | 2b363480b4ad |
15 | 14a4648e9081 |
hex | a531f163011 |
11352120111121 has 2 divisors, whose sum is σ = 11352120111122. Its totient is φ = 11352120111120.
The previous prime is 11352120111077. The next prime is 11352120111133. The reversal of 11352120111121 is 12111102125311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10842268417600 + 509851693521 = 3292760^2 + 714039^2 .
It is a cyclic number.
It is not a de Polignac number, because 11352120111121 - 27 = 11352120110993 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11352120111092 and 11352120111101.
It is not a weakly prime, because it can be changed into another prime (11352120111181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5676060055560 + 5676060055561.
It is an arithmetic number, because the mean of its divisors is an integer number (5676060055561).
Almost surely, 211352120111121 is an apocalyptic number.
It is an amenable number.
11352120111121 is a deficient number, since it is larger than the sum of its proper divisors (1).
11352120111121 is an equidigital number, since it uses as much as digits as its factorization.
11352120111121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 120, while the sum is 22.
Adding to 11352120111121 its reverse (12111102125311), we get a palindrome (23463222236432).
The spelling of 11352120111121 in words is "eleven trillion, three hundred fifty-two billion, one hundred twenty million, one hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •