Base | Representation |
---|---|
bin | 11011010011111000000011… |
… | …111011001010101110111111 |
3 | 120202021200221221100112110211 |
4 | 123103320003323022232333 |
5 | 111220413133014221142 |
6 | 1103243112305413251 |
7 | 34204613054653513 |
oct | 3323700373125677 |
9 | 522250857315424 |
10 | 120113121242047 |
11 | 352a97636646aa |
12 | 1157a88933a227 |
13 | 520380747b45b |
14 | 21937129ba143 |
15 | dd4640790917 |
hex | 6d3e03ecabbf |
120113121242047 has 2 divisors, whose sum is σ = 120113121242048. Its totient is φ = 120113121242046.
The previous prime is 120113121242039. The next prime is 120113121242113. The reversal of 120113121242047 is 740242121311021.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 120113121242047 - 23 = 120113121242039 is a prime.
It is a super-3 number, since 3×1201131212420473 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120113121212047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60056560621023 + 60056560621024.
It is an arithmetic number, because the mean of its divisors is an integer number (60056560621024).
Almost surely, 2120113121242047 is an apocalyptic number.
120113121242047 is a deficient number, since it is larger than the sum of its proper divisors (1).
120113121242047 is an equidigital number, since it uses as much as digits as its factorization.
120113121242047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5376, while the sum is 31.
Adding to 120113121242047 its reverse (740242121311021), we get a palindrome (860355242553068).
The spelling of 120113121242047 in words is "one hundred twenty trillion, one hundred thirteen billion, one hundred twenty-one million, two hundred forty-two thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •