Base | Representation |
---|---|
bin | 100110100111001101011… |
… | …1010110010101000010001 |
3 | 200210022222211222000221010 |
4 | 1031032122322302220101 |
5 | 1143421444212313203 |
6 | 15141540531321133 |
7 | 1055260345200312 |
oct | 115163272625021 |
9 | 20708884860833 |
10 | 5306883713553 |
11 | 1766700562724 |
12 | 7186147501a9 |
13 | 2c658b0a2256 |
14 | 144bd6c14609 |
15 | 9309e3c9303 |
hex | 4d39aeb2a11 |
5306883713553 has 8 divisors (see below), whose sum is σ = 7492071125088. Its totient is φ = 3329809388864.
The previous prime is 5306883713533. The next prime is 5306883713557. The reversal of 5306883713553 is 3553173886035.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5306883713553 - 29 = 5306883713041 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5306883713493 and 5306883713502.
It is not an unprimeable number, because it can be changed into a prime (5306883713557) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 52028271651 + ... + 52028271752.
It is an arithmetic number, because the mean of its divisors is an integer number (936508890636).
Almost surely, 25306883713553 is an apocalyptic number.
It is an amenable number.
5306883713553 is a deficient number, since it is larger than the sum of its proper divisors (2185187411535).
5306883713553 is a wasteful number, since it uses less digits than its factorization.
5306883713553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104056543423.
The product of its (nonzero) digits is 27216000, while the sum is 57.
It can be divided in two parts, 530688 and 3713553, that added together give a triangular number (4244241 = T2913).
The spelling of 5306883713553 in words is "five trillion, three hundred six billion, eight hundred eighty-three million, seven hundred thirteen thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •