Base | Representation |
---|---|
bin | 1001100110001110001101… |
… | …0000000010101110001111 |
3 | 1101100210012121101110112212 |
4 | 2121203203100002232033 |
5 | 2340342003042444323 |
6 | 34235345432421035 |
7 | 2136242435504231 |
oct | 231434320025617 |
9 | 41323177343485 |
10 | 10552252312463 |
11 | 33a9204374224 |
12 | 122511bb4777b |
13 | 5b70c4862484 |
14 | 286a35c5a251 |
15 | 13474d01cb78 |
hex | 998e3402b8f |
10552252312463 has 2 divisors, whose sum is σ = 10552252312464. Its totient is φ = 10552252312462.
The previous prime is 10552252312429. The next prime is 10552252312477. The reversal of 10552252312463 is 36421325225501.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10552252312463 - 216 = 10552252246927 is a prime.
It is a super-2 number, since 2×105522523124632 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10552252312463.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10552252312163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5276126156231 + 5276126156232.
It is an arithmetic number, because the mean of its divisors is an integer number (5276126156232).
Almost surely, 210552252312463 is an apocalyptic number.
10552252312463 is a deficient number, since it is larger than the sum of its proper divisors (1).
10552252312463 is an equidigital number, since it uses as much as digits as its factorization.
10552252312463 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432000, while the sum is 41.
Adding to 10552252312463 its reverse (36421325225501), we get a palindrome (46973577537964).
The spelling of 10552252312463 in words is "ten trillion, five hundred fifty-two billion, two hundred fifty-two million, three hundred twelve thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •