Base | Representation |
---|---|
bin | 101000000101010000101… |
… | …0000110110010001011101 |
3 | 201111122022110222102121012 |
4 | 1100022201100312101131 |
5 | 1210224113011344403 |
6 | 15414422111345005 |
7 | 1106000346116231 |
oct | 120124120662135 |
9 | 21448273872535 |
10 | 5508853621853 |
11 | 183432328810a |
12 | 74b79bb22165 |
13 | 30c637560b2a |
14 | 1508b679a5c1 |
15 | 98470769ed8 |
hex | 502a143645d |
5508853621853 has 2 divisors, whose sum is σ = 5508853621854. Its totient is φ = 5508853621852.
The previous prime is 5508853621841. The next prime is 5508853621877. The reversal of 5508853621853 is 3581263588055.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3383914769764 + 2124938852089 = 1839542^2 + 1457717^2 .
It is a cyclic number.
It is not a de Polignac number, because 5508853621853 - 226 = 5508786512989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5508853621792 and 5508853621801.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5508853621823) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2754426810926 + 2754426810927.
It is an arithmetic number, because the mean of its divisors is an integer number (2754426810927).
Almost surely, 25508853621853 is an apocalyptic number.
It is an amenable number.
5508853621853 is a deficient number, since it is larger than the sum of its proper divisors (1).
5508853621853 is an equidigital number, since it uses as much as digits as its factorization.
5508853621853 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34560000, while the sum is 59.
The spelling of 5508853621853 in words is "five trillion, five hundred eight billion, eight hundred fifty-three million, six hundred twenty-one thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •