Base | Representation |
---|---|
bin | 11011100001001111000000… |
… | …011101001110100100101011 |
3 | 120212112110110022112010210122 |
4 | 123201033000131032210223 |
5 | 111330433204223240243 |
6 | 1105224531520233455 |
7 | 34331131535253311 |
oct | 3341170035164453 |
9 | 525473408463718 |
10 | 121031112321323 |
11 | 356230086a3656 |
12 | 116a878276b88b |
13 | 526c2533635a9 |
14 | 21c5d1954a0b1 |
15 | ded46c4b2668 |
hex | 6e13c074e92b |
121031112321323 has 2 divisors, whose sum is σ = 121031112321324. Its totient is φ = 121031112321322.
The previous prime is 121031112321293. The next prime is 121031112321373. The reversal of 121031112321323 is 323123211130121.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 121031112321323 - 214 = 121031112304939 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121031112321292 and 121031112321301.
It is not a weakly prime, because it can be changed into another prime (121031112321373) 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, 60515556160661 + 60515556160662.
It is an arithmetic number, because the mean of its divisors is an integer number (60515556160662).
Almost surely, 2121031112321323 is an apocalyptic number.
121031112321323 is a deficient number, since it is larger than the sum of its proper divisors (1).
121031112321323 is an equidigital number, since it uses as much as digits as its factorization.
121031112321323 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 26.
Adding to 121031112321323 its reverse (323123211130121), we get a palindrome (444154323451444).
The spelling of 121031112321323 in words is "one hundred twenty-one trillion, thirty-one billion, one hundred twelve million, three hundred twenty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •