Base | Representation |
---|---|
bin | 1100000010101… |
… | …00110010000000 |
3 | 21001001212102212 |
4 | 12001110302000 |
5 | 201324314220 |
6 | 14005001252 |
7 | 2334401300 |
oct | 601246200 |
9 | 231055385 |
10 | 101010560 |
11 | 52021802 |
12 | 299b3228 |
13 | 17c08781 |
14 | d5b5600 |
15 | 8d040c5 |
hex | 6054c80 |
101010560 has 96 divisors (see below), whose sum is σ = 280990620. Its totient is φ = 34621440.
The previous prime is 101010557. The next prime is 101010577. The reversal of 101010560 is 65010101.
It can be written as a sum of positive squares in 2 ways, for example, as 100480576 + 529984 = 10024^2 + 728^2 .
It is a Harshad number since it is a multiple of its sum of digits (14).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 29750 + ... + 32970.
Almost surely, 2101010560 is an apocalyptic number.
101010560 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 101010560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (140495310).
101010560 is an abundant number, since it is smaller than the sum of its proper divisors (179980060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101010560 is an equidigital number, since it uses as much as digits as its factorization.
101010560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3254 (or 3235 counting only the distinct ones).
The product of its (nonzero) digits is 30, while the sum is 14.
The square root of 101010560 is about 10050.4009870253. The cubic root of 101010560 is about 465.7171805845.
Adding to 101010560 its reverse (65010101), we get a palindrome (166020661).
The spelling of 101010560 in words is "one hundred one million, ten thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •