Base | Representation |
---|---|
bin | 11011010101001001000100… |
… | …010100100001101100111111 |
3 | 120202121000110201001220111012 |
4 | 123111021010110201230333 |
5 | 111223324301322234341 |
6 | 1103351055235145435 |
7 | 34214112361344134 |
oct | 3325110424415477 |
9 | 522530421056435 |
10 | 120200100977471 |
11 | 35332638434269 |
12 | 1159370274527b |
13 | 520ba89642518 |
14 | 2197a0471858b |
15 | dd6a318c40eb |
hex | 6d5244521b3f |
120200100977471 has 2 divisors, whose sum is σ = 120200100977472. Its totient is φ = 120200100977470.
The previous prime is 120200100977413. The next prime is 120200100977483. The reversal of 120200100977471 is 174779001002021.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 120200100977471 - 230 = 120199027235647 is a prime.
It is a super-3 number, since 3×1202001009774713 (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 (120200100977401) 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, 60100050488735 + 60100050488736.
It is an arithmetic number, because the mean of its divisors is an integer number (60100050488736).
Almost surely, 2120200100977471 is an apocalyptic number.
120200100977471 is a deficient number, since it is larger than the sum of its proper divisors (1).
120200100977471 is an equidigital number, since it uses as much as digits as its factorization.
120200100977471 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 49392, while the sum is 41.
Adding to 120200100977471 its reverse (174779001002021), we get a palindrome (294979101979492).
The spelling of 120200100977471 in words is "one hundred twenty trillion, two hundred billion, one hundred million, nine hundred seventy-seven thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •