Base | Representation |
---|---|
bin | 100111111100110… |
… | …000111001111101 |
3 | 1201201011201221211 |
4 | 213330300321331 |
5 | 2333040143011 |
6 | 150301324421 |
7 | 22415643406 |
oct | 4774607175 |
9 | 1651151854 |
10 | 670240381 |
11 | 314373578 |
12 | 168566711 |
13 | a8b1c955 |
14 | 6502c9ad |
15 | 3dc94b21 |
hex | 27f30e7d |
670240381 has 2 divisors, whose sum is σ = 670240382. Its totient is φ = 670240380.
The previous prime is 670240369. The next prime is 670240393. The reversal of 670240381 is 183042076.
It is a balanced prime because it is at equal distance from previous prime (670240369) and next prime (670240393).
It can be written as a sum of positive squares in only one way, i.e., 633528900 + 36711481 = 25170^2 + 6059^2 .
It is a cyclic number.
It is not a de Polignac number, because 670240381 - 27 = 670240253 is a prime.
It is a super-2 number, since 2×6702403812 = 898444336646050322, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (670241381) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 335120190 + 335120191.
It is an arithmetic number, because the mean of its divisors is an integer number (335120191).
Almost surely, 2670240381 is an apocalyptic number.
It is an amenable number.
670240381 is a deficient number, since it is larger than the sum of its proper divisors (1).
670240381 is an equidigital number, since it uses as much as digits as its factorization.
670240381 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8064, while the sum is 31.
The square root of 670240381 is about 25889.0011587933. The cubic root of 670240381 is about 875.1386473085.
The spelling of 670240381 in words is "six hundred seventy million, two hundred forty thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •