Base | Representation |
---|---|
bin | 111000010110110001… |
… | …1000010001100100001 |
3 | 102120101022120202001212 |
4 | 1300231203002030201 |
5 | 3440323422234131 |
6 | 131333004035505 |
7 | 11513032410161 |
oct | 1605543021441 |
9 | 376338522055 |
10 | 121023243041 |
11 | 47364513828 |
12 | 1b556532b95 |
13 | b5491a1b1c |
14 | 5c011c45a1 |
15 | 3234c28a2b |
hex | 1c2d8c2321 |
121023243041 has 2 divisors, whose sum is σ = 121023243042. Its totient is φ = 121023243040.
The previous prime is 121023243017. The next prime is 121023243043. The reversal of 121023243041 is 140342320121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 85980900625 + 35042342416 = 293225^2 + 187196^2 .
It is a cyclic number.
It is not a de Polignac number, because 121023243041 - 214 = 121023226657 is a prime.
It is a Sophie Germain prime.
Together with 121023243043, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 121023242998 and 121023243016.
It is not a weakly prime, because it can be changed into another prime (121023243043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60511621520 + 60511621521.
It is an arithmetic number, because the mean of its divisors is an integer number (60511621521).
Almost surely, 2121023243041 is an apocalyptic number.
It is an amenable number.
121023243041 is a deficient number, since it is larger than the sum of its proper divisors (1).
121023243041 is an equidigital number, since it uses as much as digits as its factorization.
121023243041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 121023243041 its reverse (140342320121), we get a palindrome (261365563162).
The spelling of 121023243041 in words is "one hundred twenty-one billion, twenty-three million, two hundred forty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •