Base | Representation |
---|---|
bin | 1100000100001… |
… | …10111101100100 |
3 | 21001110022101110 |
4 | 12002012331210 |
5 | 201402403400 |
6 | 14013225020 |
7 | 2336215446 |
oct | 602067544 |
9 | 231408343 |
10 | 101216100 |
11 | 52152177 |
12 | 29a92170 |
13 | 17c7b1ab |
14 | d62a496 |
15 | 8d44e50 |
hex | 6086f64 |
101216100 has 72 divisors (see below), whose sum is σ = 305605440. Its totient is φ = 25815680.
The previous prime is 101216099. The next prime is 101216153. The reversal of 101216100 is 1612101.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 435 + ... + 14234.
It is an arithmetic number, because the mean of its divisors is an integer number (4244520).
Almost surely, 2101216100 is an apocalyptic number.
101216100 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 101216100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (152802720).
101216100 is an abundant number, since it is smaller than the sum of its proper divisors (204389340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101216100 is a wasteful number, since it uses less digits than its factorization.
101216100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14709 (or 14702 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 12.
The square root of 101216100 is about 10060.6212531831. The cubic root of 101216100 is about 466.0328527128.
Adding to 101216100 its reverse (1612101), we get a palindrome (102828201).
The spelling of 101216100 in words is "one hundred one million, two hundred sixteen thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •