Base | Representation |
---|---|
bin | 110111111011101001… |
… | …0110110100010000101 |
3 | 102111000212212012021221 |
4 | 1233313102312202011 |
5 | 3431442414000201 |
6 | 131102411040341 |
7 | 11451340630504 |
oct | 1576722664205 |
9 | 374025765257 |
10 | 120113031301 |
11 | 46a3774721a |
12 | 1b3417400b1 |
13 | b4327413b3 |
14 | 5b5636a83b |
15 | 31ced814a1 |
hex | 1bf74b6885 |
120113031301 has 2 divisors, whose sum is σ = 120113031302. Its totient is φ = 120113031300.
The previous prime is 120113031271. The next prime is 120113031331. The reversal of 120113031301 is 103130311021.
It is a balanced prime because it is at equal distance from previous prime (120113031271) and next prime (120113031331).
It can be written as a sum of positive squares in only one way, i.e., 110107830625 + 10005200676 = 331825^2 + 100026^2 .
It is an emirp because it is prime and its reverse (103130311021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 120113031301 - 29 = 120113030789 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120113031331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60056515650 + 60056515651.
It is an arithmetic number, because the mean of its divisors is an integer number (60056515651).
Almost surely, 2120113031301 is an apocalyptic number.
It is an amenable number.
120113031301 is a deficient number, since it is larger than the sum of its proper divisors (1).
120113031301 is an equidigital number, since it uses as much as digits as its factorization.
120113031301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 120113031301 its reverse (103130311021), we get a palindrome (223243342322).
The spelling of 120113031301 in words is "one hundred twenty billion, one hundred thirteen million, thirty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •