Base | Representation |
---|---|
bin | 11011010110111100110000… |
… | …010110111101110101011011 |
3 | 120210000220002202022101022012 |
4 | 123112330300112331311123 |
5 | 111232343201422434001 |
6 | 1103524121330420135 |
7 | 34226100551564045 |
oct | 3326746026756533 |
9 | 523026082271265 |
10 | 120324320124251 |
11 | 35380291952851 |
12 | 115b37ab43164b |
13 | 521a6c497a539 |
14 | 219da2a13ca95 |
15 | dd9da1e8c2bb |
hex | 6d6f305bdd5b |
120324320124251 has 2 divisors, whose sum is σ = 120324320124252. Its totient is φ = 120324320124250.
The previous prime is 120324320124109. The next prime is 120324320124301. The reversal of 120324320124251 is 152421023423021.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 120324320124251 - 226 = 120324253015387 is a prime.
It is a super-2 number, since 2×1203243201242512 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (120324320124551) 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, 60162160062125 + 60162160062126.
It is an arithmetic number, because the mean of its divisors is an integer number (60162160062126).
Almost surely, 2120324320124251 is an apocalyptic number.
120324320124251 is a deficient number, since it is larger than the sum of its proper divisors (1).
120324320124251 is an equidigital number, since it uses as much as digits as its factorization.
120324320124251 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23040, while the sum is 32.
Adding to 120324320124251 its reverse (152421023423021), we get a palindrome (272745343547272).
The spelling of 120324320124251 in words is "one hundred twenty trillion, three hundred twenty-four billion, three hundred twenty million, one hundred twenty-four thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •