Base | Representation |
---|---|
bin | 110001010111000110… |
… | …0111011110111011000 |
3 | 101010121110011111011020 |
4 | 1202232030323313120 |
5 | 3214042432412444 |
6 | 120410243202440 |
7 | 10441552534020 |
oct | 1425614736730 |
9 | 333543144136 |
10 | 106001841624 |
11 | 40a56304598 |
12 | 18663976420 |
13 | 9cc40a1813 |
14 | 51b81cca80 |
15 | 2b560d8119 |
hex | 18ae33bdd8 |
106001841624 has 128 divisors (see below), whose sum is σ = 320473497600. Its totient is φ = 28541842560.
The previous prime is 106001841551. The next prime is 106001841641. The reversal of 106001841624 is 426148100601.
It is a super-2 number, since 2×1060018416242 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 522739 + ... + 696605.
It is an arithmetic number, because the mean of its divisors is an integer number (2503699200).
Almost surely, 2106001841624 is an apocalyptic number.
106001841624 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 106001841624, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (160236748800).
106001841624 is an abundant number, since it is smaller than the sum of its proper divisors (214471655976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106001841624 is a wasteful number, since it uses less digits than its factorization.
106001841624 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 174093 (or 174089 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 33.
The spelling of 106001841624 in words is "one hundred six billion, one million, eight hundred forty-one thousand, six hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •