Base | Representation |
---|---|
bin | 1100000111111… |
… | …11100001100000 |
3 | 21002101101210002 |
4 | 12003333201200 |
5 | 202014204140 |
6 | 14031555132 |
7 | 2343343244 |
oct | 603774140 |
9 | 232341702 |
10 | 101709920 |
11 | 5245a194 |
12 | 2a08baa8 |
13 | 180c1bb0 |
14 | d718424 |
15 | 8de1415 |
hex | 60ff860 |
101709920 has 96 divisors (see below), whose sum is σ = 261763488. Its totient is φ = 37122048.
The previous prime is 101709919. The next prime is 101709941. The reversal of 101709920 is 29907101.
It is a zygodrome in base 2.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 222332 + ... + 222788.
It is an arithmetic number, because the mean of its divisors is an integer number (2726703).
Almost surely, 2101709920 is an apocalyptic number.
101709920 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 101709920, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (130881744).
101709920 is an abundant number, since it is smaller than the sum of its proper divisors (160053568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101709920 is a wasteful number, since it uses less digits than its factorization.
101709920 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 592 (or 584 counting only the distinct ones).
The product of its (nonzero) digits is 1134, while the sum is 29.
The square root of 101709920 is about 10085.1336133935. The cubic root of 101709920 is about 466.7895277418.
The spelling of 101709920 in words is "one hundred one million, seven hundred nine thousand, nine hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •