Base | Representation |
---|---|
bin | 100100011110110… |
… | …100111110001101 |
3 | 1120122200220221111 |
4 | 210132310332031 |
5 | 2223141423234 |
6 | 140422332021 |
7 | 21111301414 |
oct | 4436647615 |
9 | 1518626844 |
10 | 612061069 |
11 | 2945465a4 |
12 | 150b8a011 |
13 | 99a5c619 |
14 | 5b40647b |
15 | 38b01664 |
hex | 247b4f8d |
612061069 has 2 divisors, whose sum is σ = 612061070. Its totient is φ = 612061068.
The previous prime is 612061057. The next prime is 612061091. The reversal of 612061069 is 960160216.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 585156100 + 26904969 = 24190^2 + 5187^2 .
It is a cyclic number.
It is not a de Polignac number, because 612061069 - 213 = 612052877 is a prime.
It is a super-2 number, since 2×6120610692 = 749237504370845522, which contains 22 as substring.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 612061069.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (612061019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 306030534 + 306030535.
It is an arithmetic number, because the mean of its divisors is an integer number (306030535).
Almost surely, 2612061069 is an apocalyptic number.
It is an amenable number.
612061069 is a deficient number, since it is larger than the sum of its proper divisors (1).
612061069 is an equidigital number, since it uses as much as digits as its factorization.
612061069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 31.
The square root of 612061069 is about 24739.8680069236. The cubic root of 612061069 is about 849.0467139760.
The spelling of 612061069 in words is "six hundred twelve million, sixty-one thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •