Base | Representation |
---|---|
bin | 110111111011100100… |
… | …0011110111010001101 |
3 | 102111000200202002121212 |
4 | 1233313020132322031 |
5 | 3431441220004401 |
6 | 131102232504205 |
7 | 11451305546642 |
oct | 1576710367215 |
9 | 374020662555 |
10 | 120110313101 |
11 | 46a3615aa79 |
12 | 1b34084b065 |
13 | b431ccc0ac |
14 | 5b55c5ddc9 |
15 | 31ce9e5dbb |
hex | 1bf721ee8d |
120110313101 has 2 divisors, whose sum is σ = 120110313102. Its totient is φ = 120110313100.
The previous prime is 120110313097. The next prime is 120110313199. The reversal of 120110313101 is 101313011021.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 117926994025 + 2183319076 = 343405^2 + 46726^2 .
It is a cyclic number.
It is not a de Polignac number, because 120110313101 - 22 = 120110313097 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120110316101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60055156550 + 60055156551.
It is an arithmetic number, because the mean of its divisors is an integer number (60055156551).
Almost surely, 2120110313101 is an apocalyptic number.
It is an amenable number.
120110313101 is a deficient number, since it is larger than the sum of its proper divisors (1).
120110313101 is an equidigital number, since it uses as much as digits as its factorization.
120110313101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 120110313101 its reverse (101313011021), we get a palindrome (221423324122).
The spelling of 120110313101 in words is "one hundred twenty billion, one hundred ten million, three hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •