Base | Representation |
---|---|
bin | 1100100010111… |
… | …10011100100010 |
3 | 21100000222020121 |
4 | 12101132130202 |
5 | 203420310300 |
6 | 14235430454 |
7 | 2415364063 |
oct | 621363442 |
9 | 240028217 |
10 | 105244450 |
11 | 54453793 |
12 | 2b2b542a |
13 | 18a5b92c |
14 | dd9856a |
15 | 938d81a |
hex | 645e722 |
105244450 has 24 divisors (see below), whose sum is σ = 207271332. Its totient is φ = 39621120.
The previous prime is 105244397. The next prime is 105244453. The reversal of 105244450 is 54442501.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 19811401 + 85433049 = 4451^2 + 9243^2 .
It is a super-2 number, since 2×1052444502 = 22152788511605000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (105244453) 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 in 11 ways as a sum of consecutive naturals, for example, 61059 + ... + 62758.
Almost surely, 2105244450 is an apocalyptic number.
105244450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105244450 is a deficient number, since it is larger than the sum of its proper divisors (102026882).
105244450 is a wasteful number, since it uses less digits than its factorization.
105244450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123846 (or 123841 counting only the distinct ones).
The product of its (nonzero) digits is 3200, while the sum is 25.
The square root of 105244450 is about 10258.8717703264. The cubic root of 105244450 is about 472.1352223168.
Adding to 105244450 its reverse (54442501), we get a palindrome (159686951).
The spelling of 105244450 in words is "one hundred five million, two hundred forty-four thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •