Base | Representation |
---|---|
bin | 1011111011111… |
… | …10000011011001 |
3 | 20222102011221210 |
4 | 11331332003121 |
5 | 201113143113 |
6 | 13534053333 |
7 | 2324046132 |
oct | 575760331 |
9 | 228364853 |
10 | 100131033 |
11 | 51580a22 |
12 | 2964a249 |
13 | 1798b342 |
14 | d426c89 |
15 | 8bcd6c3 |
hex | 5f7e0d9 |
100131033 has 4 divisors (see below), whose sum is σ = 133508048. Its totient is φ = 66754020.
The previous prime is 100131019. The next prime is 100131049. The reversal of 100131033 is 330131001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 330131001 = 3 ⋅110043667.
It is not a de Polignac number, because 100131033 - 25 = 100131001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100131533) 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 3 ways as a sum of consecutive naturals, for example, 16688503 + ... + 16688508.
It is an arithmetic number, because the mean of its divisors is an integer number (33377012).
Almost surely, 2100131033 is an apocalyptic number.
It is an amenable number.
100131033 is a deficient number, since it is larger than the sum of its proper divisors (33377015).
100131033 is an equidigital number, since it uses as much as digits as its factorization.
100131033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33377014.
The product of its (nonzero) digits is 27, while the sum is 12.
The square root of 100131033 is about 10006.5495051991. The cubic root of 100131033 is about 464.3615286462.
Adding to 100131033 its reverse (330131001), we get a palindrome (430262034).
The spelling of 100131033 in words is "one hundred million, one hundred thirty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •