Base | Representation |
---|---|
bin | 10111101101110011000010… |
… | …01011011100111111111111 |
3 | 20211122121011110011012101012 |
4 | 23312321201023130333333 |
5 | 23313421000031102401 |
6 | 302525521215105435 |
7 | 13661536310656445 |
oct | 1366714113347777 |
9 | 224577143135335 |
10 | 52151123300351 |
11 | 15687192587219 |
12 | 5a232a181227b |
13 | 2313aa3184b5a |
14 | cc41b0ad0b95 |
15 | 6068851568bb |
hex | 2f6e612dcfff |
52151123300351 has 2 divisors, whose sum is σ = 52151123300352. Its totient is φ = 52151123300350.
The previous prime is 52151123300329. The next prime is 52151123300359. The reversal of 52151123300351 is 15300332115125.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-52151123300351 is a prime.
It is a super-2 number, since 2×521511233003512 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (52151123300359) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26075561650175 + 26075561650176.
It is an arithmetic number, because the mean of its divisors is an integer number (26075561650176).
Almost surely, 252151123300351 is an apocalyptic number.
52151123300351 is a deficient number, since it is larger than the sum of its proper divisors (1).
52151123300351 is an equidigital number, since it uses as much as digits as its factorization.
52151123300351 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13500, while the sum is 32.
Adding to 52151123300351 its reverse (15300332115125), we get a palindrome (67451455415476).
The spelling of 52151123300351 in words is "fifty-two trillion, one hundred fifty-one billion, one hundred twenty-three million, three hundred thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •