Base | Representation |
---|---|
bin | 100101010110011… |
… | …011000100111100 |
3 | 1121200010100201020 |
4 | 211112123010330 |
5 | 2240404310233 |
6 | 142102544140 |
7 | 21346211253 |
oct | 4526330474 |
9 | 1550110636 |
10 | 626635068 |
11 | 2a17a0224 |
12 | 155a38050 |
13 | 9ca930a7 |
14 | 5d31b79a |
15 | 3a02e9b3 |
hex | 2559b13c |
626635068 has 12 divisors (see below), whose sum is σ = 1462148520. Its totient is φ = 208878352.
The previous prime is 626635063. The next prime is 626635073. The reversal of 626635068 is 860536626.
626635068 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (626635063) and next prime (626635073).
It is a tau number, because it is divible by the number of its divisors (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (626635063) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 26109783 + ... + 26109806.
It is an arithmetic number, because the mean of its divisors is an integer number (121845710).
Almost surely, 2626635068 is an apocalyptic number.
It is an amenable number.
626635068 is an abundant number, since it is smaller than the sum of its proper divisors (835513452).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
626635068 is a wasteful number, since it uses less digits than its factorization.
626635068 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52219596 (or 52219594 counting only the distinct ones).
The product of its (nonzero) digits is 311040, while the sum is 42.
The square root of 626635068 is about 25032.6800003515. The cubic root of 626635068 is about 855.7329046287.
The spelling of 626635068 in words is "six hundred twenty-six million, six hundred thirty-five thousand, sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •