Base | Representation |
---|---|
bin | 101100111000100011011… |
… | …0000110111101011010101 |
3 | 210211201122111201200001012 |
4 | 1121301012300313223111 |
5 | 1302032110111100031 |
6 | 21041520032542005 |
7 | 1204451425666043 |
oct | 131610660675325 |
9 | 23751574650035 |
10 | 6168760253141 |
11 | 1a6917a386442 |
12 | 8376693b1905 |
13 | 3599334b7155 |
14 | 1747d8d4b393 |
15 | aa6e4a45b2b |
hex | 59c46c37ad5 |
6168760253141 has 2 divisors, whose sum is σ = 6168760253142. Its totient is φ = 6168760253140.
The previous prime is 6168760253137. The next prime is 6168760253237. The reversal of 6168760253141 is 1413520678616.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4986865130641 + 1181895122500 = 2233129^2 + 1087150^2 .
It is a cyclic number.
It is not a de Polignac number, because 6168760253141 - 22 = 6168760253137 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 6168760253141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6168763253141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3084380126570 + 3084380126571.
It is an arithmetic number, because the mean of its divisors is an integer number (3084380126571).
Almost surely, 26168760253141 is an apocalyptic number.
It is an amenable number.
6168760253141 is a deficient number, since it is larger than the sum of its proper divisors (1).
6168760253141 is an equidigital number, since it uses as much as digits as its factorization.
6168760253141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1451520, while the sum is 50.
The spelling of 6168760253141 in words is "six trillion, one hundred sixty-eight billion, seven hundred sixty million, two hundred fifty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •