Base | Representation |
---|---|
bin | 110001101101001010… |
… | …0000100010001111000 |
3 | 101012112000201210012020 |
4 | 1203122110010101320 |
5 | 3222101412033400 |
6 | 121011521314440 |
7 | 10466110152465 |
oct | 1433224042170 |
9 | 335460653166 |
10 | 106741908600 |
11 | 412a602a898 |
12 | 1882b795a20 |
13 | a0b14cc082 |
14 | 52485d666c |
15 | 2b9b0722a0 |
hex | 18da504478 |
106741908600 has 384 divisors, whose sum is σ = 357727104000. Its totient is φ = 26233159680.
The previous prime is 106741908593. The next prime is 106741908641. The reversal of 106741908600 is 6809147601.
It is a super-2 number, since 2×1067419086002 (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 95 ways as a sum of consecutive naturals, for example, 112005724 + ... + 112006676.
It is an arithmetic number, because the mean of its divisors is an integer number (931581000).
Almost surely, 2106741908600 is an apocalyptic number.
106741908600 is a gapful number since it is divisible by the number (10) 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 106741908600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (178863552000).
106741908600 is an abundant number, since it is smaller than the sum of its proper divisors (250985195400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106741908600 is a wasteful number, since it uses less digits than its factorization.
106741908600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1207 (or 1198 counting only the distinct ones).
The product of its (nonzero) digits is 72576, while the sum is 42.
The spelling of 106741908600 in words is "one hundred six billion, seven hundred forty-one million, nine hundred eight thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •