Base | Representation |
---|---|
bin | 1100100010001… |
… | …11011111101111 |
3 | 21022212012022000 |
4 | 12101013133233 |
5 | 203404303242 |
6 | 14233423343 |
7 | 2414523033 |
oct | 621073757 |
9 | 238765260 |
10 | 105150447 |
11 | 5439a0a6 |
12 | 2b26ab53 |
13 | 18a27bcc |
14 | dd721c3 |
15 | 9370a4c |
hex | 64477ef |
105150447 has 16 divisors (see below), whose sum is σ = 157212000. Its totient is φ = 69455232.
The previous prime is 105150443. The next prime is 105150467. The reversal of 105150447 is 744051501.
It is a happy number.
It is not a de Polignac number, because 105150447 - 22 = 105150443 is a prime.
It is a super-2 number, since 2×1051504472 = 22113233008599618, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 105150447.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105150443) 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 in 15 ways as a sum of consecutive naturals, for example, 14922 + ... + 20807.
It is an arithmetic number, because the mean of its divisors is an integer number (9825750).
Almost surely, 2105150447 is an apocalyptic number.
105150447 is a deficient number, since it is larger than the sum of its proper divisors (52061553).
105150447 is a wasteful number, since it uses less digits than its factorization.
105150447 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35847 (or 35841 counting only the distinct ones).
The product of its (nonzero) digits is 2800, while the sum is 27.
The square root of 105150447 is about 10254.2892001347. The cubic root of 105150447 is about 471.9946120591.
The spelling of 105150447 in words is "one hundred five million, one hundred fifty thousand, four hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •