Base | Representation |
---|---|
bin | 1011111011111… |
… | …10000111110000 |
3 | 20222102012100010 |
4 | 11331332013300 |
5 | 201113200222 |
6 | 13534054520 |
7 | 2324050011 |
oct | 575760760 |
9 | 228365303 |
10 | 100131312 |
11 | 51581156 |
12 | 2964a440 |
13 | 1798b4c8 |
14 | d427008 |
15 | 8bcd80c |
hex | 5f7e1f0 |
100131312 has 40 divisors (see below), whose sum is σ = 259711056. Its totient is φ = 33243136.
The previous prime is 100131281. The next prime is 100131313. The reversal of 100131312 is 213131001.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100131313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8278 + ... + 16394.
Almost surely, 2100131312 is an apocalyptic number.
100131312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100131312 is an abundant number, since it is smaller than the sum of its proper divisors (159579744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100131312 is a wasteful number, since it uses less digits than its factorization.
100131312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8385 (or 8379 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 12.
The square root of 100131312 is about 10006.5634460588. The cubic root of 100131312 is about 464.3619599369.
Adding to 100131312 its reverse (213131001), we get a palindrome (313262313).
It can be divided in two parts, 10013 and 1312, that added together give a triangular number (11325 = T150).
The spelling of 100131312 in words is "one hundred million, one hundred thirty-one thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •