Base | Representation |
---|---|
bin | 101101010000101100110… |
… | …1011110101001110100101 |
3 | 211000200111111220221201021 |
4 | 1122201121223311032211 |
5 | 1303404311012311140 |
6 | 21121413453331141 |
7 | 1211265460453111 |
oct | 132413153651645 |
9 | 24020444827637 |
10 | 6220617307045 |
11 | 1a89170331589 |
12 | 845720196ab1 |
13 | 3617a8c01c2b |
14 | 177118166741 |
15 | abc2c463b4a |
hex | 5a859af53a5 |
6220617307045 has 8 divisors (see below), whose sum is σ = 7469108678520. Its totient is φ = 4973581905600.
The previous prime is 6220617307039. The next prime is 6220617307133. The reversal of 6220617307045 is 5407037160226.
It can be written as a sum of positive squares in 4 ways, for example, as 1079691402724 + 5140925904321 = 1039082^2 + 2267361^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 6220617307045 - 25 = 6220617307013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 6220617306992 and 6220617307010.
It is a congruent number.
It is an unprimeable number.
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, 363983106 + ... + 364000195.
It is an arithmetic number, because the mean of its divisors is an integer number (933638584815).
Almost surely, 26220617307045 is an apocalyptic number.
It is an amenable number.
6220617307045 is a deficient number, since it is larger than the sum of its proper divisors (1248491371475).
6220617307045 is a wasteful number, since it uses less digits than its factorization.
6220617307045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 727985015.
The product of its (nonzero) digits is 423360, while the sum is 43.
The spelling of 6220617307045 in words is "six trillion, two hundred twenty billion, six hundred seventeen million, three hundred seven thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •