Base | Representation |
---|---|
bin | 110010111000001100111… |
… | …1111100010010101001101 |
3 | 220202111020022011201122022 |
4 | 1211300121333202111031 |
5 | 1404031413032001411 |
6 | 22512213100055525 |
7 | 1321126131320564 |
oct | 145603177422515 |
9 | 26674208151568 |
10 | 6992642843981 |
11 | 2256621651113 |
12 | 94b279b345a5 |
13 | 3b9532332282 |
14 | 1a26350a8bdb |
15 | c1d64885edb |
hex | 65c19fe254d |
6992642843981 has 2 divisors, whose sum is σ = 6992642843982. Its totient is φ = 6992642843980.
The previous prime is 6992642843873. The next prime is 6992642844007. The reversal of 6992642843981 is 1893482462996.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5949374669956 + 1043268174025 = 2439134^2 + 1021405^2 .
It is a cyclic number.
It is not a de Polignac number, because 6992642843981 - 222 = 6992638649677 is a prime.
It is a super-2 number, since 2×69926428439812 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6992642842981) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3496321421990 + 3496321421991.
It is an arithmetic number, because the mean of its divisors is an integer number (3496321421991).
Almost surely, 26992642843981 is an apocalyptic number.
It is an amenable number.
6992642843981 is a deficient number, since it is larger than the sum of its proper divisors (1).
6992642843981 is an equidigital number, since it uses as much as digits as its factorization.
6992642843981 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 322486272, while the sum is 71.
The spelling of 6992642843981 in words is "six trillion, nine hundred ninety-two billion, six hundred forty-two million, eight hundred forty-three thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •