Base | Representation |
---|---|
bin | 1100000011000… |
… | …01001100000010 |
3 | 21001011110011000 |
4 | 12001201030002 |
5 | 201332431003 |
6 | 14010032430 |
7 | 2335002405 |
oct | 601411402 |
9 | 231143130 |
10 | 101061378 |
11 | 52056a00 |
12 | 29a18716 |
13 | 17c25942 |
14 | d5c9d3c |
15 | 8d141a3 |
hex | 6061302 |
101061378 has 48 divisors (see below), whose sum is σ = 246869280. Its totient is φ = 30622680.
The previous prime is 101061377. The next prime is 101061383. The reversal of 101061378 is 873160101.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (101061377) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1200 + ... + 14267.
It is an arithmetic number, because the mean of its divisors is an integer number (5143110).
Almost surely, 2101061378 is an apocalyptic number.
101061378 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 101061378, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (123434640).
101061378 is an abundant number, since it is smaller than the sum of its proper divisors (145807902).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101061378 is a wasteful number, since it uses less digits than its factorization.
101061378 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15500 (or 15483 counting only the distinct ones).
The product of its (nonzero) digits is 1008, while the sum is 27.
The square root of 101061378 is about 10052.9288269638. The cubic root of 101061378 is about 465.7952676278.
The spelling of 101061378 in words is "one hundred one million, sixty-one thousand, three hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •