Base | Representation |
---|---|
bin | 11011100100001000011100… |
… | …011000100111000010110011 |
3 | 120220020111101200121020010022 |
4 | 123210020130120213002303 |
5 | 111342213444104012243 |
6 | 1105500221243354055 |
7 | 34351410641115365 |
oct | 3344103430470263 |
9 | 526214350536108 |
10 | 121230223110323 |
11 | 3569a4a3531428 |
12 | 1171b29052292b |
13 | 5284c65395ac2 |
14 | 21d18074bcd35 |
15 | e0372283bb68 |
hex | 6e421c6270b3 |
121230223110323 has 2 divisors, whose sum is σ = 121230223110324. Its totient is φ = 121230223110322.
The previous prime is 121230223110317. The next prime is 121230223110329. The reversal of 121230223110323 is 323011322032121.
It is a balanced prime because it is at equal distance from previous prime (121230223110317) and next prime (121230223110329).
It is a cyclic number.
It is not a de Polignac number, because 121230223110323 - 26 = 121230223110259 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121230223110292 and 121230223110301.
It is not a weakly prime, because it can be changed into another prime (121230223110329) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60615111555161 + 60615111555162.
It is an arithmetic number, because the mean of its divisors is an integer number (60615111555162).
Almost surely, 2121230223110323 is an apocalyptic number.
121230223110323 is a deficient number, since it is larger than the sum of its proper divisors (1).
121230223110323 is an equidigital number, since it uses as much as digits as its factorization.
121230223110323 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 121230223110323 its reverse (323011322032121), we get a palindrome (444241545142444).
The spelling of 121230223110323 in words is "one hundred twenty-one trillion, two hundred thirty billion, two hundred twenty-three million, one hundred ten thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •