Base | Representation |
---|---|
bin | 111000010110110001… |
… | …0001001011000001001 |
3 | 102120101022010220211022 |
4 | 1300231202021120021 |
5 | 3440323342312223 |
6 | 131332555042225 |
7 | 11513030420522 |
oct | 1605542113011 |
9 | 376338126738 |
10 | 121023010313 |
11 | 47364374997 |
12 | 1b556440375 |
13 | b54911cc0a |
14 | 5c01163849 |
15 | 3234bceac8 |
hex | 1c2d889609 |
121023010313 has 2 divisors, whose sum is σ = 121023010314. Its totient is φ = 121023010312.
The previous prime is 121023010289. The next prime is 121023010331. The reversal of 121023010313 is 313010320121.
Together with next prime (121023010331) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 65427500944 + 55595509369 = 255788^2 + 235787^2 .
It is a cyclic number.
It is not a de Polignac number, because 121023010313 - 26 = 121023010249 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 121023010291 and 121023010300.
It is not a weakly prime, because it can be changed into another prime (121023070313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60511505156 + 60511505157.
It is an arithmetic number, because the mean of its divisors is an integer number (60511505157).
Almost surely, 2121023010313 is an apocalyptic number.
It is an amenable number.
121023010313 is a deficient number, since it is larger than the sum of its proper divisors (1).
121023010313 is an equidigital number, since it uses as much as digits as its factorization.
121023010313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 121023010313 its reverse (313010320121), we get a palindrome (434033330434).
The spelling of 121023010313 in words is "one hundred twenty-one billion, twenty-three million, ten thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •