Base | Representation |
---|---|
bin | 100110011100001010101… |
… | …0110111110000001110111 |
3 | 200201001210001212220012212 |
4 | 1030320111112332001313 |
5 | 1143024412014214410 |
6 | 15123015352004035 |
7 | 1053460555020056 |
oct | 114702526760167 |
9 | 20631701786185 |
10 | 5283168116855 |
11 | 1757640740932 |
12 | 713ab639061b |
13 | 2c427b9a28b5 |
14 | 1439c728c39d |
15 | 92662365b05 |
hex | 4ce155be077 |
5283168116855 has 4 divisors (see below), whose sum is σ = 6339801740232. Its totient is φ = 4226534493480.
The previous prime is 5283168116813. The next prime is 5283168116867. The reversal of 5283168116855 is 5586118613825.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 5283168116855 - 220 = 5283167068279 is a prime.
It is a super-3 number, since 3×52831681168553 (a number of 39 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5283168116794 and 5283168116803.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 528316811681 + ... + 528316811690.
It is an arithmetic number, because the mean of its divisors is an integer number (1584950435058).
Almost surely, 25283168116855 is an apocalyptic number.
5283168116855 is a deficient number, since it is larger than the sum of its proper divisors (1056633623377).
5283168116855 is a wasteful number, since it uses less digits than its factorization.
5283168116855 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1056633623376.
The product of its digits is 13824000, while the sum is 59.
The spelling of 5283168116855 in words is "five trillion, two hundred eighty-three billion, one hundred sixty-eight million, one hundred sixteen thousand, eight hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •