Base | Representation |
---|---|
bin | 101100011011011010110… |
… | …0100001101000110001101 |
3 | 210121202011012120222112002 |
4 | 1120312311210031012031 |
5 | 1300020441320211131 |
6 | 20553051435522045 |
7 | 1200105124344464 |
oct | 130666544150615 |
9 | 23552135528462 |
10 | 6106194694541 |
11 | 1a44693798217 |
12 | 8275082b9325 |
13 | 353a72385766 |
14 | 17178185d9db |
15 | a8c81e676cb |
hex | 58db590d18d |
6106194694541 has 2 divisors, whose sum is σ = 6106194694542. Its totient is φ = 6106194694540.
The previous prime is 6106194694499. The next prime is 6106194694543. The reversal of 6106194694541 is 1454964916016.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5344465476100 + 761729218441 = 2311810^2 + 872771^2 .
It is a cyclic number.
It is not a de Polignac number, because 6106194694541 - 218 = 6106194432397 is a prime.
It is a super-2 number, since 2×61061946945412 (a number of 26 digits) contains 22 as substring.
Together with 6106194694543, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6106194694543) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3053097347270 + 3053097347271.
It is an arithmetic number, because the mean of its divisors is an integer number (3053097347271).
Almost surely, 26106194694541 is an apocalyptic number.
It is an amenable number.
6106194694541 is a deficient number, since it is larger than the sum of its proper divisors (1).
6106194694541 is an equidigital number, since it uses as much as digits as its factorization.
6106194694541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5598720, while the sum is 56.
The spelling of 6106194694541 in words is "six trillion, one hundred six billion, one hundred ninety-four million, six hundred ninety-four thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •