Base | Representation |
---|---|
bin | 101100101001011100101… |
… | …1101101000100010110001 |
3 | 210201121221000210120012201 |
4 | 1121102321131220202301 |
5 | 1301014143130230024 |
6 | 21014553321423201 |
7 | 1202222564431021 |
oct | 131227135504261 |
9 | 23647830716181 |
10 | 6136324851889 |
11 | 1a56445450401 |
12 | 83131693ab01 |
13 | 3568646bcb2b |
14 | 172ddd2a9a81 |
15 | a9947201744 |
hex | 594b97688b1 |
6136324851889 has 2 divisors, whose sum is σ = 6136324851890. Its totient is φ = 6136324851888.
The previous prime is 6136324851827. The next prime is 6136324851907. The reversal of 6136324851889 is 9881584236316.
6136324851889 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5802510145600 + 333814706289 = 2408840^2 + 577767^2 .
It is a cyclic number.
It is not a de Polignac number, because 6136324851889 - 225 = 6136291297457 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 6136324851889.
It is not a weakly prime, because it can be changed into another prime (6136324851809) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3068162425944 + 3068162425945.
It is an arithmetic number, because the mean of its divisors is an integer number (3068162425945).
Almost surely, 26136324851889 is an apocalyptic number.
It is an amenable number.
6136324851889 is a deficient number, since it is larger than the sum of its proper divisors (1).
6136324851889 is an equidigital number, since it uses as much as digits as its factorization.
6136324851889 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 59719680, while the sum is 64.
The spelling of 6136324851889 in words is "six trillion, one hundred thirty-six billion, three hundred twenty-four million, eight hundred fifty-one thousand, eight hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •