Base | Representation |
---|---|
bin | 1011100001110010… |
… | …10110010101111101 |
3 | 120222022210021102221 |
4 | 11300321112111331 |
5 | 100133344033323 |
6 | 2502044445341 |
7 | 306241023154 |
oct | 56071262575 |
9 | 16868707387 |
10 | 6189049213 |
11 | 2696614306 |
12 | 1248849851 |
13 | 7782ba7c9 |
14 | 429d8059b |
15 | 26352c55d |
hex | 170e5657d |
6189049213 has 2 divisors, whose sum is σ = 6189049214. Its totient is φ = 6189049212.
The previous prime is 6189049193. The next prime is 6189049247. The reversal of 6189049213 is 3129409816.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5990295609 + 198753604 = 77397^2 + 14098^2 .
It is a cyclic number.
It is not a de Polignac number, because 6189049213 - 221 = 6186952061 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 6189049213.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6189049283) 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, 3094524606 + 3094524607.
It is an arithmetic number, because the mean of its divisors is an integer number (3094524607).
Almost surely, 26189049213 is an apocalyptic number.
It is an amenable number.
6189049213 is a deficient number, since it is larger than the sum of its proper divisors (1).
6189049213 is an equidigital number, since it uses as much as digits as its factorization.
6189049213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 93312, while the sum is 43.
The square root of 6189049213 is about 78670.5104406982. The cubic root of 6189049213 is about 1836.0083218842.
The spelling of 6189049213 in words is "six billion, one hundred eighty-nine million, forty-nine thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •