Base | Representation |
---|---|
bin | 1000010011111100… |
… | …0011010011100001 |
3 | 12202111020200210121 |
4 | 2010333003103201 |
5 | 14032131333441 |
6 | 1005220400241 |
7 | 106201134205 |
oct | 20477032341 |
9 | 5674220717 |
10 | 2231121121 |
11 | a45456359 |
12 | 523246081 |
13 | 297309a18 |
14 | 17245cb05 |
15 | d0d17dd1 |
hex | 84fc34e1 |
2231121121 has 2 divisors, whose sum is σ = 2231121122. Its totient is φ = 2231121120.
The previous prime is 2231121107. The next prime is 2231121143. The reversal of 2231121121 is 1211211322.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1624976721 + 606144400 = 40311^2 + 24620^2 .
It is a cyclic number.
It is not a de Polignac number, because 2231121121 - 27 = 2231120993 is a prime.
It is a super-3 number, since 3×22311211213 (a number of 29 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2231121095 and 2231121104.
It is not a weakly prime, because it can be changed into another prime (2231521121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1115560560 + 1115560561.
It is an arithmetic number, because the mean of its divisors is an integer number (1115560561).
Almost surely, 22231121121 is an apocalyptic number.
It is an amenable number.
2231121121 is a deficient number, since it is larger than the sum of its proper divisors (1).
2231121121 is an equidigital number, since it uses as much as digits as its factorization.
2231121121 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 48, while the sum is 16.
The square root of 2231121121 is about 47234.7448495279. The cubic root of 2231121121 is about 1306.6954609425.
Adding to 2231121121 its reverse (1211211322), we get a palindrome (3442332443).
The spelling of 2231121121 in words is "two billion, two hundred thirty-one million, one hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •