Base | Representation |
---|---|
bin | 1100011101100… |
… | …10100110000000 |
3 | 21021201012200000 |
4 | 12032302212000 |
5 | 203230244134 |
6 | 14212400000 |
7 | 2406402633 |
oct | 616624600 |
9 | 237635600 |
10 | 104540544 |
11 | 54012949 |
12 | 2b016000 |
13 | 18873414 |
14 | dc53c1a |
15 | 929ee99 |
hex | 63b2980 |
104540544 has 96 divisors (see below), whose sum is σ = 312060840. Its totient is φ = 34836480.
The previous prime is 104540521. The next prime is 104540551. The reversal of 104540544 is 445045401.
It is a tau number, because it is divible by the number of its divisors (96).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 29424 + ... + 32784.
Almost surely, 2104540544 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 104540544, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (156030420).
104540544 is an abundant number, since it is smaller than the sum of its proper divisors (207520296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104540544 is an frugal number, since it uses more digits than its factorization.
104540544 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3390 (or 3366 counting only the distinct ones).
The product of its (nonzero) digits is 6400, while the sum is 27.
The square root of 104540544 is about 10224.5070296812. The cubic root of 104540544 is about 471.0802735508.
Adding to 104540544 its reverse (445045401), we get a palindrome (549585945).
The spelling of 104540544 in words is "one hundred four million, five hundred forty thousand, five hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •