Base | Representation |
---|---|
bin | 101000001011101… |
… | …001001101111100 |
3 | 1201222111220200010 |
4 | 220023221031330 |
5 | 2340040003202 |
6 | 150521103220 |
7 | 22464050544 |
oct | 5013511574 |
9 | 1658456603 |
10 | 674141052 |
11 | 316598172 |
12 | 169927b10 |
13 | a9887240 |
14 | 65766324 |
15 | 3e2b576c |
hex | 282e937c |
674141052 has 144 divisors (see below), whose sum is σ = 1896621440. Its totient is φ = 184716288.
The previous prime is 674141011. The next prime is 674141059. The reversal of 674141052 is 250141476.
674141052 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an alternating number because its digits alternate between even and odd.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (674141059) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 856203 + ... + 856989.
Almost surely, 2674141052 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 674141052, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (948310720).
674141052 is an abundant number, since it is smaller than the sum of its proper divisors (1222480388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
674141052 is a wasteful number, since it uses less digits than its factorization.
674141052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 860 (or 841 counting only the distinct ones).
The product of its (nonzero) digits is 6720, while the sum is 30.
The square root of 674141052 is about 25964.2263893997. The cubic root of 674141052 is about 876.8330777182.
The spelling of 674141052 in words is "six hundred seventy-four million, one hundred forty-one thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •