Base | Representation |
---|---|
bin | 1100000010100… |
… | …10011110111110 |
3 | 21001001101112100 |
4 | 12001102132332 |
5 | 201324014100 |
6 | 14004445530 |
7 | 2334331665 |
oct | 601223676 |
9 | 231041470 |
10 | 101001150 |
11 | 52015728 |
12 | 299a98a6 |
13 | 17c043c3 |
14 | d5b1ddc |
15 | 8d01400 |
hex | 60527be |
101001150 has 72 divisors (see below), whose sum is σ = 285662520. Its totient is φ = 25513920.
The previous prime is 101001149. The next prime is 101001179. The reversal of 101001150 is 51100101.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 2644 + ... + 14456.
It is an arithmetic number, because the mean of its divisors is an integer number (3967535).
Almost surely, 2101001150 is an apocalyptic number.
101001150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 101001150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (142831260).
101001150 is an abundant number, since it is smaller than the sum of its proper divisors (184661370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101001150 is a wasteful number, since it uses less digits than its factorization.
101001150 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11850 (or 11842 counting only the distinct ones).
The product of its (nonzero) digits is 5, while the sum is 9.
The square root of 101001150 is about 10049.9328355965. The cubic root of 101001150 is about 465.7027182855.
Adding to 101001150 its reverse (51100101), we get a palindrome (152101251).
The spelling of 101001150 in words is "one hundred one million, one thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •