Base | Representation |
---|---|
bin | 1100000110001… |
… | …00011011100000 |
3 | 21001221002202100 |
4 | 12003010123200 |
5 | 201433432442 |
6 | 14022450400 |
7 | 2341314462 |
oct | 603043340 |
9 | 231832670 |
10 | 101467872 |
11 | 52304350 |
12 | 29b93a00 |
13 | 1803897c |
14 | d694132 |
15 | 8d9484c |
hex | 60c46e0 |
101467872 has 72 divisors (see below), whose sum is σ = 314790840. Its totient is φ = 30746880.
The previous prime is 101467871. The next prime is 101467889. The reversal of 101467872 is 278764101.
It is a tau number, because it is divible by the number of its divisors (72).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101467871) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 12847 + ... + 19182.
It is an arithmetic number, because the mean of its divisors is an integer number (4372095).
Almost surely, 2101467872 is an apocalyptic number.
101467872 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101467872 is an abundant number, since it is smaller than the sum of its proper divisors (213322968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101467872 is a wasteful number, since it uses less digits than its factorization.
101467872 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32056 (or 32045 counting only the distinct ones).
The product of its (nonzero) digits is 18816, while the sum is 36.
The square root of 101467872 is about 10073.1262277408. The cubic root of 101467872 is about 466.4189469848.
It can be divided in two parts, 1014 and 67872, that added together give a palindrome (68886).
The spelling of 101467872 in words is "one hundred one million, four hundred sixty-seven thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •