Base | Representation |
---|---|
bin | 100110101111111111101… |
… | …1011111111000000010111 |
3 | 200212010200200012222111012 |
4 | 1031133333123333000113 |
5 | 1144224114000141113 |
6 | 15154341001402435 |
7 | 1056526023060614 |
oct | 115377733770027 |
9 | 20763620188435 |
10 | 5325750005783 |
11 | 1773702044279 |
12 | 7201baa9941b |
13 | 2c82a692668c |
14 | 145aa670550b |
15 | 93805851aa8 |
hex | 4d7ff6ff017 |
5325750005783 has 4 divisors (see below), whose sum is σ = 5327057584128. Its totient is φ = 5324442427440.
The previous prime is 5325750005759. The next prime is 5325750005791. The reversal of 5325750005783 is 3875000575235.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5325750005783 - 228 = 5325481570327 is a prime.
It is a super-2 number, since 2×53257500057832 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5325750005183) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 653783063 + ... + 653791208.
It is an arithmetic number, because the mean of its divisors is an integer number (1331764396032).
Almost surely, 25325750005783 is an apocalyptic number.
5325750005783 is a deficient number, since it is larger than the sum of its proper divisors (1307578345).
5325750005783 is a wasteful number, since it uses less digits than its factorization.
5325750005783 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1307578344.
The product of its (nonzero) digits is 4410000, while the sum is 50.
The spelling of 5325750005783 in words is "five trillion, three hundred twenty-five billion, seven hundred fifty million, five thousand, seven hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •