Base | Representation |
---|---|
bin | 1100000100101… |
… | …10000100110000 |
3 | 21001120110022001 |
4 | 12002112010300 |
5 | 201411344000 |
6 | 14014423344 |
7 | 2336564065 |
oct | 602260460 |
9 | 231513261 |
10 | 101278000 |
11 | 5219472a |
12 | 29b01b54 |
13 | 17ca0415 |
14 | d644c6c |
15 | 8d5846a |
hex | 6096130 |
101278000 has 80 divisors (see below), whose sum is σ = 248376960. Its totient is φ = 39936000.
The previous prime is 101277983. The next prime is 101278003. The reversal of 101278000 is 872101.
It is a tau number, because it is divible by the number of its divisors (80).
It is not an unprimeable number, because it can be changed into a prime (101278003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 157680 + ... + 158320.
It is an arithmetic number, because the mean of its divisors is an integer number (3104712).
Almost surely, 2101278000 is an apocalyptic number.
101278000 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 101278000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (124188480).
101278000 is an abundant number, since it is smaller than the sum of its proper divisors (147098960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101278000 is an equidigital number, since it uses as much as digits as its factorization.
101278000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 743 (or 727 counting only the distinct ones).
The product of its (nonzero) digits is 112, while the sum is 19.
The square root of 101278000 is about 10063.6971337576. The cubic root of 101278000 is about 466.1278361358.
The spelling of 101278000 in words is "one hundred one million, two hundred seventy-eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •