Base | Representation |
---|---|
bin | 111000011010000001… |
… | …0011010000000010001 |
3 | 102120122220110210100002 |
4 | 1300310002122000101 |
5 | 3441034311132241 |
6 | 131351453535345 |
7 | 11515524055616 |
oct | 1606402320021 |
9 | 376586423302 |
10 | 121132130321 |
11 | 4740aa25414 |
12 | 1b586aa4555 |
13 | b565907877 |
14 | 5c1184a50d |
15 | 323e58689b |
hex | 1c3409a011 |
121132130321 has 2 divisors, whose sum is σ = 121132130322. Its totient is φ = 121132130320.
The previous prime is 121132130299. The next prime is 121132130347. The reversal of 121132130321 is 123031231121.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 115420549696 + 5711580625 = 339736^2 + 75575^2 .
It is a cyclic number.
It is not a de Polignac number, because 121132130321 - 210 = 121132129297 is a prime.
It is a super-2 number, since 2×1211321303212 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 121132130293 and 121132130302.
It is not a weakly prime, because it can be changed into another prime (121132130351) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60566065160 + 60566065161.
It is an arithmetic number, because the mean of its divisors is an integer number (60566065161).
Almost surely, 2121132130321 is an apocalyptic number.
It is an amenable number.
121132130321 is a deficient number, since it is larger than the sum of its proper divisors (1).
121132130321 is an equidigital number, since it uses as much as digits as its factorization.
121132130321 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 121132130321 its reverse (123031231121), we get a palindrome (244163361442).
The spelling of 121132130321 in words is "one hundred twenty-one billion, one hundred thirty-two million, one hundred thirty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •