Base | Representation |
---|---|
bin | 11010011110011101111101 |
3 | 111001121122002 |
4 | 122132131331 |
5 | 3234044131 |
6 | 404432045 |
7 | 112664546 |
oct | 32363575 |
9 | 14047562 |
10 | 6940541 |
11 | 3a10593 |
12 | 23a8625 |
13 | 159013a |
14 | cc94cd |
15 | 9216cb |
hex | 69e77d |
6940541 has 4 divisors (see below), whose sum is σ = 7179900. Its totient is φ = 6701184.
The previous prime is 6940513. The next prime is 6940561. The reversal of 6940541 is 1450496.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4084441 + 2856100 = 2021^2 + 1690^2 .
It is a cyclic number.
It is not a de Polignac number, because 6940541 - 26 = 6940477 is a prime.
It is a super-2 number, since 2×69405412 = 96342218745362, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (29), and also a Moran number because the ratio is a prime number: 239329 = 6940541 / (6 + 9 + 4 + 0 + 5 + 4 + 1).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6940561) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 119636 + ... + 119693.
It is an arithmetic number, because the mean of its divisors is an integer number (1794975).
Almost surely, 26940541 is an apocalyptic number.
It is an amenable number.
6940541 is a deficient number, since it is larger than the sum of its proper divisors (239359).
6940541 is a wasteful number, since it uses less digits than its factorization.
6940541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 239358.
The product of its (nonzero) digits is 4320, while the sum is 29.
The square root of 6940541 is about 2634.4906528587. The cubic root of 6940541 is about 190.7499537648.
The spelling of 6940541 in words is "six million, nine hundred forty thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •