Base | Representation |
---|---|
bin | 101111001101000111… |
… | …1001000100010000000 |
3 | 100200122210010101201120 |
4 | 1132122033020202000 |
5 | 3130102201444201 |
6 | 114323011432240 |
7 | 10216042661652 |
oct | 1363217104200 |
9 | 320583111646 |
10 | 101371906176 |
11 | 39a9a886562 |
12 | 177912b5680 |
13 | 9736b02a48 |
14 | 4c9933c6d2 |
15 | 29848d0536 |
hex | 179a3c8880 |
101371906176 has 128 divisors (see below), whose sum is σ = 277314466560. Its totient is φ = 32786104320.
The previous prime is 101371906169. The next prime is 101371906199. The reversal of 101371906176 is 671609173101.
It is a tau number, because it is divible by the number of its divisors (128).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5204616 + ... + 5224056.
It is an arithmetic number, because the mean of its divisors is an integer number (2166519270).
Almost surely, 2101371906176 is an apocalyptic number.
101371906176 is a gapful number since it is divisible by the number (16) 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 101371906176, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (138657233280).
101371906176 is an abundant number, since it is smaller than the sum of its proper divisors (175942560384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101371906176 is a wasteful number, since it uses less digits than its factorization.
101371906176 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19862 (or 19850 counting only the distinct ones).
The product of its (nonzero) digits is 47628, while the sum is 42.
The spelling of 101371906176 in words is "one hundred one billion, three hundred seventy-one million, nine hundred six thousand, one hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •