Base | Representation |
---|---|
bin | 11011010011110111001000… |
… | …110110110000101101001001 |
3 | 120202021121101212120222001011 |
4 | 123103313020312300231021 |
5 | 111220404120314343423 |
6 | 1103242430104523521 |
7 | 34204546362342016 |
oct | 3323671066605511 |
9 | 522247355528034 |
10 | 120112130231113 |
11 | 352a92a52204a9 |
12 | 1157a6514805a1 |
13 | 52036aa06a957 |
14 | 219365b12c70d |
15 | dd45d3787b0d |
hex | 6d3dc8db0b49 |
120112130231113 has 2 divisors, whose sum is σ = 120112130231114. Its totient is φ = 120112130231112.
The previous prime is 120112130231111. The next prime is 120112130231123. The reversal of 120112130231113 is 311132031211021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 120035097338809 + 77032892304 = 10956053^2 + 277548^2 .
It is a cyclic number.
It is not a de Polignac number, because 120112130231113 - 21 = 120112130231111 is a prime.
Together with 120112130231111, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (120112130231111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60056065115556 + 60056065115557.
It is an arithmetic number, because the mean of its divisors is an integer number (60056065115557).
Almost surely, 2120112130231113 is an apocalyptic number.
It is an amenable number.
120112130231113 is a deficient number, since it is larger than the sum of its proper divisors (1).
120112130231113 is an equidigital number, since it uses as much as digits as its factorization.
120112130231113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 120112130231113 its reverse (311132031211021), we get a palindrome (431244161442134).
The spelling of 120112130231113 in words is "one hundred twenty trillion, one hundred twelve billion, one hundred thirty million, two hundred thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •