Base | Representation |
---|---|
bin | 11010010111111110111101 |
3 | 111000021012101 |
4 | 122113332331 |
5 | 3232221411 |
6 | 404105101 |
7 | 112524244 |
oct | 32277675 |
9 | 14007171 |
10 | 6913981 |
11 | 39a2638 |
12 | 2395191 |
13 | 1581019 |
14 | cbd95b |
15 | 9188c1 |
hex | 697fbd |
6913981 has 4 divisors (see below), whose sum is σ = 6933600. Its totient is φ = 6894364.
The previous prime is 6913969. The next prime is 6913987. The reversal of 6913981 is 1893196.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 6913981 - 29 = 6913469 is a prime.
It is a super-2 number, since 2×69139812 = 95606266536722, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 6913981.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6913987) 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 3 ways as a sum of consecutive naturals, for example, 9271 + ... + 9988.
It is an arithmetic number, because the mean of its divisors is an integer number (1733400).
Almost surely, 26913981 is an apocalyptic number.
It is an amenable number.
6913981 is a deficient number, since it is larger than the sum of its proper divisors (19619).
6913981 is a wasteful number, since it uses less digits than its factorization.
6913981 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19618.
The product of its digits is 11664, while the sum is 37.
The square root of 6913981 is about 2629.4449984740. Note that the first 3 decimals coincide. The cubic root of 6913981 is about 190.5063226546.
The spelling of 6913981 in words is "six million, nine hundred thirteen thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •