Base | Representation |
---|---|
bin | 110001101001001011100… |
… | …0010110010100110111001 |
3 | 220011021012120101122010022 |
4 | 1203102113002302212321 |
5 | 1343241341143012431 |
6 | 22302225533300225 |
7 | 1302640603302050 |
oct | 143222702624671 |
9 | 26137176348108 |
10 | 6822942157241 |
11 | 21a0658a79481 |
12 | 9223b9634675 |
13 | 3a65293c5532 |
14 | 1983370a7397 |
15 | bc73146107b |
hex | 634970b29b9 |
6822942157241 has 4 divisors (see below), whose sum is σ = 7797648179712. Its totient is φ = 5848236134772.
The previous prime is 6822942157193. The next prime is 6822942157261. The reversal of 6822942157241 is 1427512492286.
6822942157241 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6822942157241 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6822942157261) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 487353011225 + ... + 487353011238.
It is an arithmetic number, because the mean of its divisors is an integer number (1949412044928).
Almost surely, 26822942157241 is an apocalyptic number.
It is an amenable number.
6822942157241 is a deficient number, since it is larger than the sum of its proper divisors (974706022471).
6822942157241 is an equidigital number, since it uses as much as digits as its factorization.
6822942157241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 974706022470.
The product of its digits is 3870720, while the sum is 53.
The spelling of 6822942157241 in words is "six trillion, eight hundred twenty-two billion, nine hundred forty-two million, one hundred fifty-seven thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •