Base | Representation |
---|---|
bin | 110010111000110011000… |
… | …1100100001101110000001 |
3 | 220202121112101211220222001 |
4 | 1211301212030201232001 |
5 | 1404042022324132021 |
6 | 22512544010144001 |
7 | 1321202614214440 |
oct | 145614614415601 |
9 | 26677471756861 |
10 | 6993921317761 |
11 | 2257118286414 |
12 | 94b576122001 |
13 | 3b96a7171231 |
14 | 1a2716bc4d57 |
15 | c1ddbc23091 |
hex | 65c66321b81 |
6993921317761 has 16 divisors (see below), whose sum is σ = 8043698348928. Its totient is φ = 5956820352000.
The previous prime is 6993921317743. The next prime is 6993921317771. The reversal of 6993921317761 is 1677131293996.
It is not a de Polignac number, because 6993921317761 - 27 = 6993921317633 is a prime.
It is a super-3 number, since 3×69939213177613 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 6993921317693 and 6993921317702.
It is not an unprimeable number, because it can be changed into a prime (6993921317771) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5118561 + ... + 6339361.
It is an arithmetic number, because the mean of its divisors is an integer number (502731146808).
Almost surely, 26993921317761 is an apocalyptic number.
It is an amenable number.
6993921317761 is a deficient number, since it is larger than the sum of its proper divisors (1049777031167).
6993921317761 is a wasteful number, since it uses less digits than its factorization.
6993921317761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1225992.
The product of its digits is 23147208, while the sum is 64.
The spelling of 6993921317761 in words is "six trillion, nine hundred ninety-three billion, nine hundred twenty-one million, three hundred seventeen thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •