Base | Representation |
---|---|
bin | 1101000010001001… |
… | …01010111111101001 |
3 | 200001122200212200000 |
4 | 12201010222333221 |
5 | 103312303330003 |
6 | 3114200533213 |
7 | 335254161540 |
oct | 64104527751 |
9 | 20048625600 |
10 | 6997323753 |
11 | 2a708969a2 |
12 | 1433481209 |
13 | 8768a9a74 |
14 | 4a5461157 |
15 | 2ae48b1a3 |
hex | 1a112afe9 |
6997323753 has 48 divisors (see below), whose sum is σ = 12271249536. Its totient is φ = 3900908160.
The previous prime is 6997323731. The next prime is 6997323761. The reversal of 6997323753 is 3573237996.
It is not a de Polignac number, because 6997323753 - 213 = 6997315561 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 6997323753.
It is not an unprimeable number, because it can be changed into a prime (6997323653) 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 47 ways as a sum of consecutive naturals, for example, 19575 + ... + 119907.
It is an arithmetic number, because the mean of its divisors is an integer number (255651032).
Almost surely, 26997323753 is an apocalyptic number.
6997323753 is a gapful number since it is divisible by the number (63) formed by its first and last digit.
It is an amenable number.
6997323753 is a deficient number, since it is larger than the sum of its proper divisors (5273925783).
6997323753 is a wasteful number, since it uses less digits than its factorization.
6997323753 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100396 (or 100384 counting only the distinct ones).
The product of its digits is 6429780, while the sum is 54.
The square root of 6997323753 is about 83650.0074895394. The cubic root of 6997323753 is about 1912.6873671102.
The spelling of 6997323753 in words is "six billion, nine hundred ninety-seven million, three hundred twenty-three thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •