Base | Representation |
---|---|
bin | 101000000111010… |
… | …101110110001101 |
3 | 1201220101121110100 |
4 | 220013111312031 |
5 | 2334242410013 |
6 | 150441001313 |
7 | 22451342262 |
oct | 5007256615 |
9 | 1656347410 |
10 | 673013133 |
11 | 315997801 |
12 | 169483239 |
13 | a9580a30 |
14 | 65551269 |
15 | 3e141473 |
hex | 281d5d8d |
673013133 has 24 divisors (see below), whose sum is σ = 1066672152. Its totient is φ = 406343808.
The previous prime is 673013129. The next prime is 673013141. The reversal of 673013133 is 331310376.
673013133 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 4 ways, for example, as 233289 + 672779844 = 483^2 + 25938^2 .
It is not a de Polignac number, because 673013133 - 22 = 673013129 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 673013097 and 673013106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (673013233) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 48066 + ... + 60467.
It is an arithmetic number, because the mean of its divisors is an integer number (44444673).
Almost surely, 2673013133 is an apocalyptic number.
It is an amenable number.
673013133 is a deficient number, since it is larger than the sum of its proper divisors (393659019).
673013133 is a wasteful number, since it uses less digits than its factorization.
673013133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108605 (or 108602 counting only the distinct ones).
The product of its (nonzero) digits is 3402, while the sum is 27.
The square root of 673013133 is about 25942.4966608844. The cubic root of 673013133 is about 876.3437890307.
The spelling of 673013133 in words is "six hundred seventy-three million, thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •