Base | Representation |
---|---|
bin | 1100000011011… |
… | …01110101110000 |
3 | 21001021002020100 |
4 | 12001231311300 |
5 | 201341110300 |
6 | 14011112400 |
7 | 2335306446 |
oct | 601556560 |
9 | 231232210 |
10 | 101113200 |
11 | 52091931 |
12 | 29a42700 |
13 | 17c433c6 |
14 | d600b96 |
15 | 8d24700 |
hex | 606dd70 |
101113200 has 90 divisors (see below), whose sum is σ = 350903384. Its totient is φ = 26962560.
The previous prime is 101113189. The next prime is 101113211. The reversal of 101113200 is 2311101.
It is an interprime number because it is at equal distance from previous prime (101113189) and next prime (101113211).
It is a tau number, because it is divible by the number of its divisors (90).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 10444 + ... + 17643.
Almost surely, 2101113200 is an apocalyptic number.
101113200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101113200 is an abundant number, since it is smaller than the sum of its proper divisors (249790184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101113200 is a wasteful number, since it uses less digits than its factorization.
101113200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28111 (or 28097 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
The square root of 101113200 is about 10055.5059544510. The cubic root of 101113200 is about 465.8748704663.
Adding to 101113200 its reverse (2311101), we get a palindrome (103424301).
The spelling of 101113200 in words is "one hundred one million, one hundred thirteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •