Base | Representation |
---|---|
bin | 100101011100111… |
… | …001110111110101 |
3 | 1121210022200022012 |
4 | 211130321313311 |
5 | 2241323142234 |
6 | 142203214005 |
7 | 21366515516 |
oct | 4534716765 |
9 | 1553280265 |
10 | 628334069 |
11 | 2a2750760 |
12 | 156517305 |
13 | a023950c |
14 | 5d640a0d |
15 | 3a2680ce |
hex | 25739df5 |
628334069 has 4 divisors (see below), whose sum is σ = 685455360. Its totient is φ = 571212780.
The previous prime is 628334051. The next prime is 628334101. The reversal of 628334069 is 960433826.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-628334069 is a prime.
It is a super-2 number, since 2×6283340692 = 789607404532193522, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (628330069) 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 in 3 ways as a sum of consecutive naturals, for example, 28560629 + ... + 28560650.
It is an arithmetic number, because the mean of its divisors is an integer number (171363840).
Almost surely, 2628334069 is an apocalyptic number.
It is an amenable number.
628334069 is a deficient number, since it is larger than the sum of its proper divisors (57121291).
628334069 is a wasteful number, since it uses less digits than its factorization.
628334069 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57121290.
The product of its (nonzero) digits is 186624, while the sum is 41.
The square root of 628334069 is about 25066.5926882774. The cubic root of 628334069 is about 856.5055920232.
The spelling of 628334069 in words is "six hundred twenty-eight million, three hundred thirty-four thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •