Base | Representation |
---|---|
bin | 1100000100101… |
… | …00010111011110 |
3 | 21001120002201000 |
4 | 12002110113132 |
5 | 201411133011 |
6 | 14014331130 |
7 | 2336534514 |
oct | 602242736 |
9 | 231502630 |
10 | 101271006 |
11 | 5218a451 |
12 | 29ab9aa6 |
13 | 17c9a195 |
14 | d6424b4 |
15 | 8d56356 |
hex | 60945de |
101271006 has 64 divisors (see below), whose sum is σ = 240744960. Its totient is φ = 31443840.
The previous prime is 101270999. The next prime is 101271029. The reversal of 101271006 is 600172101.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a self number, because there is not a number n which added to its sum of digits gives 101271006.
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 31 ways as a sum of consecutive naturals, for example, 97711 + ... + 98741.
It is an arithmetic number, because the mean of its divisors is an integer number (3761640).
Almost surely, 2101271006 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101271006, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (120372480).
101271006 is an abundant number, since it is smaller than the sum of its proper divisors (139473954).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101271006 is a wasteful number, since it uses less digits than its factorization.
101271006 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1166 (or 1160 counting only the distinct ones).
The product of its (nonzero) digits is 84, while the sum is 18.
The square root of 101271006 is about 10063.3496411483. The cubic root of 101271006 is about 466.1171060228.
The spelling of 101271006 in words is "one hundred one million, two hundred seventy-one thousand, six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •