Base | Representation |
---|---|
bin | 100111000010100010111… |
… | …1011001010100000000001 |
3 | 200222221112000002201001101 |
4 | 1032011011323022200001 |
5 | 1200402210321240423 |
6 | 15224530004534401 |
7 | 1062436153311661 |
oct | 116050573124001 |
9 | 20887460081041 |
10 | 5365587290113 |
11 | 1789595165656 |
12 | 727a783b1401 |
13 | 2cbc8507737b |
14 | 1479a54381a1 |
15 | 94887de67ad |
hex | 4e145eca801 |
5365587290113 has 4 divisors (see below), whose sum is σ = 5401120980928. Its totient is φ = 5330053599300.
The previous prime is 5365587290099. The next prime is 5365587290131. The reversal of 5365587290113 is 3110927855635.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5365587290113 - 225 = 5365553735681 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5365587290213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17766845181 + ... + 17766845482.
It is an arithmetic number, because the mean of its divisors is an integer number (1350280245232).
Almost surely, 25365587290113 is an apocalyptic number.
It is an amenable number.
5365587290113 is a deficient number, since it is larger than the sum of its proper divisors (35533690815).
5365587290113 is a wasteful number, since it uses less digits than its factorization.
5365587290113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35533690814.
The product of its (nonzero) digits is 6804000, while the sum is 55.
The spelling of 5365587290113 in words is "five trillion, three hundred sixty-five billion, five hundred eighty-seven million, two hundred ninety thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •