Base | Representation |
---|---|
bin | 1100000010111… |
… | …01101010110000 |
3 | 21001010201101000 |
4 | 12001131222300 |
5 | 201332000320 |
6 | 14005442000 |
7 | 2334612360 |
oct | 601355260 |
9 | 231121330 |
10 | 101046960 |
11 | 52047093 |
12 | 29a10300 |
13 | 17c1c201 |
14 | d5c49a0 |
15 | 8d0ec90 |
hex | 605dab0 |
101046960 has 320 divisors, whose sum is σ = 409973760. Its totient is φ = 22394880.
The previous prime is 101046941. The next prime is 101046961. The reversal of 101046960 is 69640101.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (101046961) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 619839 + ... + 620001.
It is an arithmetic number, because the mean of its divisors is an integer number (1281168).
Almost surely, 2101046960 is an apocalyptic number.
101046960 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 101046960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (204986880).
101046960 is an abundant number, since it is smaller than the sum of its proper divisors (308926800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101046960 is a wasteful number, since it uses less digits than its factorization.
101046960 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 233 (or 221 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 27.
The square root of 101046960 is about 10052.2116969352. The cubic root of 101046960 is about 465.7731155597.
The spelling of 101046960 in words is "one hundred one million, forty-six thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •