Base | Representation |
---|---|
bin | 1100000100010… |
… | …00101011000100 |
3 | 21001110200000000 |
4 | 12002020223010 |
5 | 201403114413 |
6 | 14013321300 |
7 | 2336245050 |
oct | 602105304 |
9 | 231420000 |
10 | 101223108 |
11 | 52157468 |
12 | 29a96230 |
13 | 17c8143c |
14 | d62cc60 |
15 | 8d47073 |
hex | 6088ac4 |
101223108 has 216 divisors, whose sum is σ = 330657600. Its totient is φ = 26453952.
The previous prime is 101223077. The next prime is 101223113. The reversal of 101223108 is 801322101.
It is a super-2 number, since 2×1012231082 = 20492235186359328, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 3490438 + ... + 3490466.
Almost surely, 2101223108 is an apocalyptic number.
101223108 is a gapful number since it is divisible by the number (18) 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 101223108, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (165328800).
101223108 is an abundant number, since it is smaller than the sum of its proper divisors (229434492).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101223108 is an equidigital number, since it uses as much as digits as its factorization.
101223108 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83 (or 60 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
The square root of 101223108 is about 10060.9695357853. The cubic root of 101223108 is about 466.0436081916.
Adding to 101223108 its reverse (801322101), we get a palindrome (902545209).
The spelling of 101223108 in words is "one hundred one million, two hundred twenty-three thousand, one hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •