Base | Representation |
---|---|
bin | 11000111100100111… |
… | …01110000000110101 |
3 | 1021120102000120202121 |
4 | 30132103232000311 |
5 | 204412201400243 |
6 | 10053002435541 |
7 | 652620626116 |
oct | 143623560065 |
9 | 37512016677 |
10 | 13393387573 |
11 | 5753244355 |
12 | 2719502bb1 |
13 | 1355a39607 |
14 | 910acc20d |
15 | 535c5b1ed |
hex | 31e4ee035 |
13393387573 has 2 divisors, whose sum is σ = 13393387574. Its totient is φ = 13393387572.
The previous prime is 13393387541. The next prime is 13393387619. The reversal of 13393387573 is 37578339331.
13393387573 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13386027204 + 7360369 = 115698^2 + 2713^2 .
It is a cyclic number.
It is not a de Polignac number, because 13393387573 - 25 = 13393387541 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13393387573.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13393387873) 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 as a sum of consecutive naturals, namely, 6696693786 + 6696693787.
It is an arithmetic number, because the mean of its divisors is an integer number (6696693787).
Almost surely, 213393387573 is an apocalyptic number.
It is an amenable number.
13393387573 is a deficient number, since it is larger than the sum of its proper divisors (1).
13393387573 is an equidigital number, since it uses as much as digits as its factorization.
13393387573 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4286520, while the sum is 52.
The spelling of 13393387573 in words is "thirteen billion, three hundred ninety-three million, three hundred eighty-seven thousand, five hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •