Base | Representation |
---|---|
bin | 110010001101011011111… |
… | …1101110110101001101101 |
3 | 220102201011220001010112111 |
4 | 1210122313331312221231 |
5 | 1401030321301010131 |
6 | 22402104025204021 |
7 | 1311365232343204 |
oct | 144326775665155 |
9 | 26381156033474 |
10 | 6900803922541 |
11 | 2220683a02141 |
12 | 935509330611 |
13 | 3b09875432c9 |
14 | 19c001c8223b |
15 | be78bd63ab1 |
hex | 646b7f76a6d |
6900803922541 has 4 divisors (see below), whose sum is σ = 6900809254300. Its totient is φ = 6900798590784.
The previous prime is 6900803922499. The next prime is 6900803922589. The reversal of 6900803922541 is 1452293080096.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 5913505332900 + 987298589641 = 2431770^2 + 993629^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6900803922541 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6900803122541) 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, 651955 + ... + 3771823.
It is an arithmetic number, because the mean of its divisors is an integer number (1725202313575).
Almost surely, 26900803922541 is an apocalyptic number.
It is an amenable number.
6900803922541 is a deficient number, since it is larger than the sum of its proper divisors (5331759).
6900803922541 is a wasteful number, since it uses less digits than its factorization.
6900803922541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5331758.
The product of its (nonzero) digits is 933120, while the sum is 49.
The spelling of 6900803922541 in words is "six trillion, nine hundred billion, eight hundred three million, nine hundred twenty-two thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •