Base | Representation |
---|---|
bin | 100110101001011000000… |
… | …0011100110110111100001 |
3 | 200210202222220000011222202 |
4 | 1031102300003212313201 |
5 | 1144011010012013010 |
6 | 15144030144342545 |
7 | 1055513514143306 |
oct | 115226003466741 |
9 | 20722886004882 |
10 | 5311533313505 |
11 | 17686770a1a11 |
12 | 7194b1914a55 |
13 | 2c6b4c467823 |
14 | 1451185430ad |
15 | 932726b86a5 |
hex | 4d4b00e6de1 |
5311533313505 has 4 divisors (see below), whose sum is σ = 6373839976212. Its totient is φ = 4249226650800.
The previous prime is 5311533313501. The next prime is 5311533313507. The reversal of 5311533313505 is 5053133351135.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1103964185809 + 4207569127696 = 1050697^2 + 2051236^2 .
It is not a de Polignac number, because 5311533313505 - 22 = 5311533313501 is a prime.
It is a super-2 number, since 2×53115333135052 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5311533313501) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 531153331346 + ... + 531153331355.
It is an arithmetic number, because the mean of its divisors is an integer number (1593459994053).
Almost surely, 25311533313505 is an apocalyptic number.
It is an amenable number.
5311533313505 is a deficient number, since it is larger than the sum of its proper divisors (1062306662707).
5311533313505 is a wasteful number, since it uses less digits than its factorization.
5311533313505 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1062306662706.
The product of its (nonzero) digits is 151875, while the sum is 38.
The spelling of 5311533313505 in words is "five trillion, three hundred eleven billion, five hundred thirty-three million, three hundred thirteen thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •