Base | Representation |
---|---|
bin | 110000101000000101… |
… | …1111010011111100000 |
3 | 100222112112011000120002 |
4 | 1201100023322133200 |
5 | 3202330133444202 |
6 | 115545535435132 |
7 | 10354510510520 |
oct | 1412013723740 |
9 | 328475130502 |
10 | 104424515552 |
11 | 40316a0a125 |
12 | 182a3685aa8 |
13 | 9b02377296 |
14 | 50a891b680 |
15 | 2ab28b7302 |
hex | 18502fa7e0 |
104424515552 has 96 divisors (see below), whose sum is σ = 236177726400. Its totient is φ = 44521095168.
The previous prime is 104424515549. The next prime is 104424515609. The reversal of 104424515552 is 255515424401.
It is a congruent number.
It is an unprimeable number.
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, 50469974 + ... + 50472042.
It is an arithmetic number, because the mean of its divisors is an integer number (2460184650).
Almost surely, 2104424515552 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 104424515552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (118088863200).
104424515552 is an abundant number, since it is smaller than the sum of its proper divisors (131753210848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104424515552 is a wasteful number, since it uses less digits than its factorization.
104424515552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3148 (or 3140 counting only the distinct ones).
The product of its (nonzero) digits is 160000, while the sum is 38.
Adding to 104424515552 its reverse (255515424401), we get a palindrome (359939939953).
The spelling of 104424515552 in words is "one hundred four billion, four hundred twenty-four million, five hundred fifteen thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •