Base | Representation |
---|---|
bin | 100110010010110110010… |
… | …1001011111110100010001 |
3 | 200122011010111212012101101 |
4 | 1030211230221133310101 |
5 | 1142212421341131103 |
6 | 15105510012304401 |
7 | 1052151645526114 |
oct | 114455451376421 |
9 | 20564114765341 |
10 | 5263157755153 |
11 | 174a102384a21 |
12 | 710050a72101 |
13 | 2c241010a89c |
14 | 142a4986a57b |
15 | 91d9074ea1d |
hex | 4c96ca5fd11 |
5263157755153 has 8 divisors (see below), whose sum is σ = 5572777069440. Its totient is φ = 4953540863040.
The previous prime is 5263157755133. The next prime is 5263157755183. The reversal of 5263157755153 is 3515577513625.
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 5263157755153 - 213 = 5263157746961 is a prime.
It is a super-3 number, since 3×52631577551533 (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 = 5263157755094 and 5263157755103.
It is not an unprimeable number, because it can be changed into a prime (5263157755133) 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, 5810508 + ... + 6654946.
It is an arithmetic number, because the mean of its divisors is an integer number (696597133680).
Almost surely, 25263157755153 is an apocalyptic number.
It is an amenable number.
5263157755153 is a deficient number, since it is larger than the sum of its proper divisors (309619314287).
5263157755153 is a wasteful number, since it uses less digits than its factorization.
5263157755153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1211087.
The product of its digits is 16537500, while the sum is 55.
The spelling of 5263157755153 in words is "five trillion, two hundred sixty-three billion, one hundred fifty-seven million, seven hundred fifty-five thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •