Base | Representation |
---|---|
bin | 101000001101100… |
… | …110001101110101 |
3 | 1202000110220222211 |
4 | 220031212031311 |
5 | 2340202344140 |
6 | 150540053421 |
7 | 22501312333 |
oct | 5015461565 |
9 | 1660426884 |
10 | 674653045 |
11 | 316907900 |
12 | 169b34271 |
13 | a9a062b1 |
14 | 6585ab53 |
15 | 3e3672ea |
hex | 28366375 |
674653045 has 36 divisors (see below), whose sum is σ = 939477420. Its totient is φ = 464682240.
The previous prime is 674653027. The next prime is 674653099. The reversal of 674653045 is 540356476.
674653045 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 454457124 + 220195921 = 21318^2 + 14839^2 .
It is not a de Polignac number, because 674653045 - 27 = 674652917 is a prime.
It is a super-2 number, since 2×6746530452 = 910313462255544050, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 674652989 and 674653007.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 216861 + ... + 219949.
It is an arithmetic number, because the mean of its divisors is an integer number (26096595).
Almost surely, 2674653045 is an apocalyptic number.
It is an amenable number.
674653045 is a deficient number, since it is larger than the sum of its proper divisors (264824375).
674653045 is a wasteful number, since it uses less digits than its factorization.
674653045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3154 (or 3124 counting only the distinct ones).
The product of its (nonzero) digits is 302400, while the sum is 40.
The square root of 674653045 is about 25974.0841031979. The cubic root of 674653045 is about 877.0549990276.
The spelling of 674653045 in words is "six hundred seventy-four million, six hundred fifty-three thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •