Base | Representation |
---|---|
bin | 1100000010101… |
… | …00111100000000 |
3 | 21001001220022120 |
4 | 12001110330000 |
5 | 201324324300 |
6 | 14005004240 |
7 | 2334403203 |
oct | 601247400 |
9 | 231056276 |
10 | 101011200 |
11 | 52022234 |
12 | 299b3680 |
13 | 17c08b54 |
14 | d5b593a |
15 | 8d043a0 |
hex | 6054f00 |
101011200 has 108 divisors (see below), whose sum is σ = 333421368. Its totient is φ = 26931200.
The previous prime is 101011189. The next prime is 101011259. The reversal of 101011200 is 2110101.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is a congruent number.
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, 16570 + ... + 21830.
Almost surely, 2101011200 is an apocalyptic number.
101011200 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 101011200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (166710684).
101011200 is an abundant number, since it is smaller than the sum of its proper divisors (232410168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101011200 is an equidigital number, since it uses as much as digits as its factorization.
101011200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5290 (or 5271 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 6.
The square root of 101011200 is about 10050.4328265006. The cubic root of 101011200 is about 465.7181641727.
Adding to 101011200 its reverse (2110101), we get a palindrome (103121301).
The spelling of 101011200 in words is "one hundred one million, eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •