Base | Representation |
---|---|
bin | 111011011101101101001010… |
… | …0101001111001011011000111 |
3 | 2112120222022011020011210222111 |
4 | 1312323122110221321123013 |
5 | 1022024141402010040201 |
6 | 5052234510345241451 |
7 | 215113163101533355 |
oct | 16673322451713307 |
9 | 2476868136153874 |
10 | 523052201252551 |
11 | 14172a213734213 |
12 | 4a7b702ba93287 |
13 | 195b17c32c6b29 |
14 | 9323c0c3c67d5 |
15 | 4070bc4c35b51 |
hex | 1dbb694a796c7 |
523052201252551 has 2 divisors, whose sum is σ = 523052201252552. Its totient is φ = 523052201252550.
The previous prime is 523052201252549. The next prime is 523052201252569. The reversal of 523052201252551 is 155252102250325.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 523052201252551 - 21 = 523052201252549 is a prime.
It is a super-2 number, since 2×5230522012525512 (a number of 30 digits) contains 22 as substring.
Together with 523052201252549, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (523052201252851) 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, 261526100626275 + 261526100626276.
It is an arithmetic number, because the mean of its divisors is an integer number (261526100626276).
Almost surely, 2523052201252551 is an apocalyptic number.
523052201252551 is a deficient number, since it is larger than the sum of its proper divisors (1).
523052201252551 is an equidigital number, since it uses as much as digits as its factorization.
523052201252551 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 300000, while the sum is 40.
The spelling of 523052201252551 in words is "five hundred twenty-three trillion, fifty-two billion, two hundred one million, two hundred fifty-two thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •