Base | Representation |
---|---|
bin | 1100100011000… |
… | …00111000110001 |
3 | 21100001110221221 |
4 | 12101200320301 |
5 | 203421120244 |
6 | 14235545041 |
7 | 2415435166 |
oct | 621407061 |
9 | 240043857 |
10 | 105254449 |
11 | 54460253 |
12 | 2b2bb181 |
13 | 18a63351 |
14 | dd9c06d |
15 | 9391784 |
hex | 6460e31 |
105254449 has 8 divisors (see below), whose sum is σ = 107431272. Its totient is φ = 103084800.
The previous prime is 105254437. The next prime is 105254459. The reversal of 105254449 is 944452501.
It can be written as a sum of positive squares in 4 ways, for example, as 39125025 + 66129424 = 6255^2 + 8132^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 105254449 - 217 = 105123377 is a prime.
It is a super-2 number, since 2×1052544492 = 22156998068587202, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105254419) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 35737 + ... + 38569.
It is an arithmetic number, because the mean of its divisors is an integer number (13428909).
Almost surely, 2105254449 is an apocalyptic number.
It is an amenable number.
105254449 is a deficient number, since it is larger than the sum of its proper divisors (2176823).
105254449 is an equidigital number, since it uses as much as digits as its factorization.
105254449 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3587.
The product of its (nonzero) digits is 28800, while the sum is 34.
The square root of 105254449 is about 10259.3590930428. The cubic root of 105254449 is about 472.1501739543.
The spelling of 105254449 in words is "one hundred five million, two hundred fifty-four thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.583 sec. • engine limits •