Base | Representation |
---|---|
bin | 1011011001100110… |
… | …0001110001001101 |
3 | 21220021012111002012 |
4 | 2312121201301031 |
5 | 22231344121404 |
6 | 1223353311005 |
7 | 135555543131 |
oct | 26631416115 |
9 | 7807174065 |
10 | 3060145229 |
11 | 1330410449 |
12 | 714a05465 |
13 | 399cb262b |
14 | 2105c13c1 |
15 | 12d9c4a6e |
hex | b6661c4d |
3060145229 has 2 divisors, whose sum is σ = 3060145230. Its totient is φ = 3060145228.
The previous prime is 3060145223. The next prime is 3060145307. The reversal of 3060145229 is 9225410603.
It is a happy number.
3060145229 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2745969604 + 314175625 = 52402^2 + 17725^2 .
It is a cyclic number.
It is not a de Polignac number, because 3060145229 - 24 = 3060145213 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3060145195 and 3060145204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3060145223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1530072614 + 1530072615.
It is an arithmetic number, because the mean of its divisors is an integer number (1530072615).
Almost surely, 23060145229 is an apocalyptic number.
It is an amenable number.
3060145229 is a deficient number, since it is larger than the sum of its proper divisors (1).
3060145229 is an equidigital number, since it uses as much as digits as its factorization.
3060145229 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12960, while the sum is 32.
The square root of 3060145229 is about 55318.5794195766. The cubic root of 3060145229 is about 1451.8241376773.
The spelling of 3060145229 in words is "three billion, sixty million, one hundred forty-five thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •