Base | Representation |
---|---|
bin | 1100000111001… |
… | …01110100010000 |
3 | 21002012001100020 |
4 | 12003211310100 |
5 | 202002321444 |
6 | 14025423440 |
7 | 2342424252 |
oct | 603456420 |
9 | 232161306 |
10 | 101604624 |
11 | 52398070 |
12 | 2a03ab80 |
13 | 18085ca4 |
14 | d6cbcd2 |
15 | 8dc0119 |
hex | 60e5d10 |
101604624 has 80 divisors (see below), whose sum is σ = 288076800. Its totient is φ = 30602880.
The previous prime is 101604611. The next prime is 101604653. The reversal of 101604624 is 426406101.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 101604594 and 101604603.
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 15 ways as a sum of consecutive naturals, for example, 104589 + ... + 105555.
It is an arithmetic number, because the mean of its divisors is an integer number (3600960).
Almost surely, 2101604624 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 101604624, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (144038400).
101604624 is an abundant number, since it is smaller than the sum of its proper divisors (186472176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101604624 is a wasteful number, since it uses less digits than its factorization.
101604624 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1188 (or 1182 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
The square root of 101604624 is about 10079.9119043769. The cubic root of 101604624 is about 466.6283896043.
The spelling of 101604624 in words is "one hundred one million, six hundred four thousand, six hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •