Base | Representation |
---|---|
bin | 1011001111000000001… |
… | …1100101111001011001 |
3 | 200110011220220102111221 |
4 | 2303300003211321121 |
5 | 11130234021101041 |
6 | 224355445052041 |
7 | 16641604140046 |
oct | 2636003457131 |
9 | 613156812457 |
10 | 193006034521 |
11 | 74942969443 |
12 | 314a53b7021 |
13 | 1527b349b71 |
14 | 94ad2961cd |
15 | 504944d2d1 |
hex | 2cf00e5e59 |
193006034521 has 2 divisors, whose sum is σ = 193006034522. Its totient is φ = 193006034520.
The previous prime is 193006034489. The next prime is 193006034579. The reversal of 193006034521 is 125430600391.
193006034521 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., 192865018896 + 141015625 = 439164^2 + 11875^2 .
It is an emirp because it is prime and its reverse (125430600391) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 193006034521 - 25 = 193006034489 is a prime.
It is not a weakly prime, because it can be changed into another prime (193006034591) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 96503017260 + 96503017261.
It is an arithmetic number, because the mean of its divisors is an integer number (96503017261).
Almost surely, 2193006034521 is an apocalyptic number.
It is an amenable number.
193006034521 is a deficient number, since it is larger than the sum of its proper divisors (1).
193006034521 is an equidigital number, since it uses as much as digits as its factorization.
193006034521 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19440, while the sum is 34.
The spelling of 193006034521 in words is "one hundred ninety-three billion, six million, thirty-four thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •