Base | Representation |
---|---|
bin | 10001101000101110… |
… | …001010010101010001 |
3 | 1210212201221010211221 |
4 | 101220232022111101 |
5 | 302240310104333 |
6 | 12411025205041 |
7 | 1240162102114 |
oct | 215056122521 |
9 | 53781833757 |
10 | 18936800593 |
11 | 803836a627 |
12 | 3805a90781 |
13 | 1a2a340469 |
14 | cb900657b |
15 | 75c753d2d |
hex | 468b8a551 |
18936800593 has 4 divisors (see below), whose sum is σ = 19010484900. Its totient is φ = 18863116288.
The previous prime is 18936800591. The next prime is 18936800609. The reversal of 18936800593 is 39500863981.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 39500863981 = 11393 ⋅3467117.
It can be written as a sum of positive squares in 2 ways, for example, as 14073551424 + 4863249169 = 118632^2 + 69737^2 .
It is a cyclic number.
It is not a de Polignac number, because 18936800593 - 21 = 18936800591 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 18936800593.
It is not an unprimeable number, because it can be changed into a prime (18936800591) 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, 36841768 + ... + 36842281.
It is an arithmetic number, because the mean of its divisors is an integer number (4752621225).
Almost surely, 218936800593 is an apocalyptic number.
It is an amenable number.
18936800593 is a deficient number, since it is larger than the sum of its proper divisors (73684307).
18936800593 is an equidigital number, since it uses as much as digits as its factorization.
18936800593 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73684306.
The product of its (nonzero) digits is 1399680, while the sum is 52.
The spelling of 18936800593 in words is "eighteen billion, nine hundred thirty-six million, eight hundred thousand, five hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •