Base | Representation |
---|---|
bin | 100110111011001001100… |
… | …1110111010111010011001 |
3 | 200221102112002201121100122 |
4 | 1031312103032322322121 |
5 | 1200122143314224333 |
6 | 15213341552243025 |
7 | 1061334443334554 |
oct | 115662316727231 |
9 | 20842462647318 |
10 | 5349704445593 |
11 | 1782884769472 |
12 | 724985240475 |
13 | 2ca623660411 |
14 | 146cd9c8169b |
15 | 94258843798 |
hex | 4dd933bae99 |
5349704445593 has 4 divisors (see below), whose sum is σ = 5349710574288. Its totient is φ = 5349698316900.
The previous prime is 5349704445529. The next prime is 5349704445623. The reversal of 5349704445593 is 3955444079435.
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, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 5349704445593 - 26 = 5349704445529 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (5349704445193) 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, 1482983 + ... + 3591468.
It is an arithmetic number, because the mean of its divisors is an integer number (1337427643572).
Almost surely, 25349704445593 is an apocalyptic number.
It is an amenable number.
5349704445593 is a deficient number, since it is larger than the sum of its proper divisors (6128695).
5349704445593 is a wasteful number, since it uses less digits than its factorization.
5349704445593 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6128694.
The product of its (nonzero) digits is 163296000, while the sum is 62.
The spelling of 5349704445593 in words is "five trillion, three hundred forty-nine billion, seven hundred four million, four hundred forty-five thousand, five hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •