Base | Representation |
---|---|
bin | 101101010011101001010… |
… | …0100001111100001111101 |
3 | 211001021211011210200220211 |
4 | 1122213102210033201331 |
5 | 1304010233210444221 |
6 | 21124341125512421 |
7 | 1211611246321525 |
oct | 132472244174175 |
9 | 24037734720824 |
10 | 6226940328061 |
11 | 1a9091552a892 |
12 | 8469a5872711 |
13 | 362275b98c9b |
14 | 177557c1c685 |
15 | abe9c6066e1 |
hex | 5a9d290f87d |
6226940328061 has 8 divisors (see below), whose sum is σ = 6593358127104. Its totient is φ = 5860536661440.
The previous prime is 6226940328031. The next prime is 6226940328121. The reversal of 6226940328061 is 1608230496226.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 6226940328061 - 223 = 6226931939453 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 6226940327996 and 6226940328014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6226940328001) 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 in 7 ways as a sum of consecutive naturals, for example, 2619195 + ... + 4394776.
It is an arithmetic number, because the mean of its divisors is an integer number (824169765888).
Almost surely, 26226940328061 is an apocalyptic number.
It is an amenable number.
6226940328061 is a deficient number, since it is larger than the sum of its proper divisors (366417799043).
6226940328061 is a wasteful number, since it uses less digits than its factorization.
6226940328061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7066211.
The product of its (nonzero) digits is 1492992, while the sum is 49.
The spelling of 6226940328061 in words is "six trillion, two hundred twenty-six billion, nine hundred forty million, three hundred twenty-eight thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •