Base | Representation |
---|---|
bin | 1100101010100111… |
… | …10101011010000101 |
3 | 122112220100100220211 |
4 | 12111103311122011 |
5 | 102411243100343 |
6 | 3042430555421 |
7 | 330336544114 |
oct | 62523653205 |
9 | 18486310824 |
10 | 6799971973 |
11 | 297a452653 |
12 | 1399368b71 |
13 | 844a3bc72 |
14 | 48716bc7b |
15 | 29bea679d |
hex | 1954f5685 |
6799971973 has 16 divisors (see below), whose sum is σ = 7050073536. Its totient is φ = 6555669120.
The previous prime is 6799971961. The next prime is 6799972019. The reversal of 6799971973 is 3791799976.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6799971973 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (67).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 6799971899 and 6799971908.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6799971943) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 635415 + ... + 646027.
It is an arithmetic number, because the mean of its divisors is an integer number (440629596).
Almost surely, 26799971973 is an apocalyptic number.
It is an amenable number.
6799971973 is a deficient number, since it is larger than the sum of its proper divisors (250101563).
6799971973 is a wasteful number, since it uses less digits than its factorization.
6799971973 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10884.
The product of its digits is 40507614, while the sum is 67.
The square root of 6799971973 is about 82461.9425735290. The cubic root of 6799971973 is about 1894.5338715166.
The spelling of 6799971973 in words is "six billion, seven hundred ninety-nine million, nine hundred seventy-one thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •