Base | Representation |
---|---|
bin | 1110010101001… |
… | …0001011101001 |
3 | 11012002200011202 |
4 | 3211102023221 |
5 | 110341333244 |
6 | 5544133545 |
7 | 1326613355 |
oct | 345221351 |
9 | 135080152 |
10 | 60105449 |
11 | 30a23128 |
12 | 181672b5 |
13 | c5b5c71 |
14 | 7da8465 |
15 | 542404e |
hex | 39522e9 |
60105449 has 2 divisors, whose sum is σ = 60105450. Its totient is φ = 60105448.
The previous prime is 60105439. The next prime is 60105469. The reversal of 60105449 is 94450106.
60105449 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., 58415449 + 1690000 = 7643^2 + 1300^2 .
It is a cyclic number.
It is not a de Polignac number, because 60105449 - 28 = 60105193 is a prime.
It is a super-2 number, since 2×601054492 = 7225329998983202, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (60105439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 30052724 + 30052725.
It is an arithmetic number, because the mean of its divisors is an integer number (30052725).
Almost surely, 260105449 is an apocalyptic number.
It is an amenable number.
60105449 is a deficient number, since it is larger than the sum of its proper divisors (1).
60105449 is an equidigital number, since it uses as much as digits as its factorization.
60105449 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 29.
The square root of 60105449 is about 7752.7704080541. The cubic root of 60105449 is about 391.7159737130.
The spelling of 60105449 in words is "sixty million, one hundred five thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •