Base | Representation |
---|---|
bin | 110111111011010110… |
… | …1000001000110100001 |
3 | 102111000012012022002221 |
4 | 1233312231001012201 |
5 | 3431432344104441 |
6 | 131101414311041 |
7 | 11451160421515 |
oct | 1576655010641 |
9 | 374005168087 |
10 | 120103113121 |
11 | 46a32092582 |
12 | 1b33a358481 |
13 | b43067ab54 |
14 | 5b54d08145 |
15 | 31ce0728d1 |
hex | 1bf6b411a1 |
120103113121 has 2 divisors, whose sum is σ = 120103113122. Its totient is φ = 120103113120.
The previous prime is 120103113089. The next prime is 120103113127. The reversal of 120103113121 is 121311301021.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 113471291025 + 6631822096 = 336855^2 + 81436^2 .
It is a cyclic number.
It is not a de Polignac number, because 120103113121 - 25 = 120103113089 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 120103113095 and 120103113104.
It is not a weakly prime, because it can be changed into another prime (120103113127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60051556560 + 60051556561.
It is an arithmetic number, because the mean of its divisors is an integer number (60051556561).
Almost surely, 2120103113121 is an apocalyptic number.
It is an amenable number.
120103113121 is a deficient number, since it is larger than the sum of its proper divisors (1).
120103113121 is an equidigital number, since it uses as much as digits as its factorization.
120103113121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 120103113121 its reverse (121311301021), we get a palindrome (241414414142).
The spelling of 120103113121 in words is "one hundred twenty billion, one hundred three million, one hundred thirteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •