Base | Representation |
---|---|
bin | 101111101101011000110… |
… | …1101100111110110001101 |
3 | 212012212000200112010211120 |
4 | 1133122301231213312031 |
5 | 1324412421003324441 |
6 | 21540142500111153 |
7 | 1244510043104556 |
oct | 137326155476615 |
9 | 25185020463746 |
10 | 6557101620621 |
11 | 20a893aa15652 |
12 | 89a9880954b9 |
13 | 387441613866 |
14 | 18951899332d |
15 | b5872b4e966 |
hex | 5f6b1b67d8d |
6557101620621 has 8 divisors (see below), whose sum is σ = 8781316708704. Its totient is φ = 4352143806480.
The previous prime is 6557101620611. The next prime is 6557101620691. The reversal of 6557101620621 is 1260261017556.
6557101620621 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 6557101620621 - 210 = 6557101619597 is a prime.
It is a super-2 number, since 2×65571016206212 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6557101620611) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4814317690 + ... + 4814319051.
It is an arithmetic number, because the mean of its divisors is an integer number (1097664588588).
Almost surely, 26557101620621 is an apocalyptic number.
It is an amenable number.
6557101620621 is a deficient number, since it is larger than the sum of its proper divisors (2224215088083).
6557101620621 is a wasteful number, since it uses less digits than its factorization.
6557101620621 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9628636971.
The product of its (nonzero) digits is 151200, while the sum is 42.
The spelling of 6557101620621 in words is "six trillion, five hundred fifty-seven billion, one hundred one million, six hundred twenty thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •