Base | Representation |
---|---|
bin | 101000001011100… |
… | …000101001010101 |
3 | 1201222110010111201 |
4 | 220023200221111 |
5 | 2340032342231 |
6 | 150520232501 |
7 | 22463543305 |
oct | 5013405125 |
9 | 1658403451 |
10 | 674105941 |
11 | 316573853 |
12 | 16990b731 |
13 | a9874272 |
14 | 65757605 |
15 | 3e2aa161 |
hex | 282e0a55 |
674105941 has 4 divisors (see below), whose sum is σ = 674167500. Its totient is φ = 674044384.
The previous prime is 674105917. The next prime is 674105983. The reversal of 674105941 is 149501476.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 271260900 + 402845041 = 16470^2 + 20071^2 .
It is a cyclic number.
It is not a de Polignac number, because 674105941 - 227 = 539888213 is a prime.
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 674105941.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (674105441) 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, 9406 + ... + 37903.
It is an arithmetic number, because the mean of its divisors is an integer number (168541875).
Almost surely, 2674105941 is an apocalyptic number.
It is an amenable number.
674105941 is a deficient number, since it is larger than the sum of its proper divisors (61559).
674105941 is a wasteful number, since it uses less digits than its factorization.
674105941 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61558.
The product of its (nonzero) digits is 30240, while the sum is 37.
The square root of 674105941 is about 25963.5502387482. The cubic root of 674105941 is about 876.8178548799.
The spelling of 674105941 in words is "six hundred seventy-four million, one hundred five thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •