Base | Representation |
---|---|
bin | 111000010110011100… |
… | …0101001001000010001 |
3 | 102120100112200011021122 |
4 | 1300230320221020101 |
5 | 3440313101132241 |
6 | 131331525532025 |
7 | 11512536064445 |
oct | 1605470511021 |
9 | 376315604248 |
10 | 121012130321 |
11 | 47359213665 |
12 | 1b552874015 |
13 | b546ab0954 |
14 | 5bdd930825 |
15 | 3233c8104b |
hex | 1c2ce29211 |
121012130321 has 2 divisors, whose sum is σ = 121012130322. Its totient is φ = 121012130320.
The previous prime is 121012130311. The next prime is 121012130341. The reversal of 121012130321 is 123031210121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 111993969025 + 9018161296 = 334655^2 + 94964^2 .
It is a cyclic number.
It is not a de Polignac number, because 121012130321 - 26 = 121012130257 is a prime.
It is a super-4 number, since 4×1210121303214 (a number of 45 digits) contains 4444 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 121012130321.
It is not a weakly prime, because it can be changed into another prime (121012130311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60506065160 + 60506065161.
It is an arithmetic number, because the mean of its divisors is an integer number (60506065161).
Almost surely, 2121012130321 is an apocalyptic number.
It is an amenable number.
121012130321 is a deficient number, since it is larger than the sum of its proper divisors (1).
121012130321 is an equidigital number, since it uses as much as digits as its factorization.
121012130321 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 121012130321 its reverse (123031210121), we get a palindrome (244043340442).
The spelling of 121012130321 in words is "one hundred twenty-one billion, twelve million, one hundred thirty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •