Base | Representation |
---|---|
bin | 1011111110000… |
… | …00111101111001 |
3 | 20222221002220220 |
4 | 11333000331321 |
5 | 201200430423 |
6 | 13544010253 |
7 | 2326300164 |
oct | 577007571 |
9 | 228832826 |
10 | 100405113 |
11 | 51748936 |
12 | 29760989 |
13 | 17a56013 |
14 | d498adb |
15 | 8c349e3 |
hex | 5fc0f79 |
100405113 has 8 divisors (see below), whose sum is σ = 136722048. Its totient is φ = 65512464.
The previous prime is 100405073. The next prime is 100405141. The reversal of 100405113 is 311504001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100405113 - 26 = 100405049 is a prime.
It is a super-3 number, since 3×1004051133 (a number of 25 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100405092 and 100405101.
It is not an unprimeable number, because it can be changed into a prime (100405153) 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, 355906 + ... + 356187.
It is an arithmetic number, because the mean of its divisors is an integer number (17090256).
Almost surely, 2100405113 is an apocalyptic number.
It is an amenable number.
100405113 is a deficient number, since it is larger than the sum of its proper divisors (36316935).
100405113 is an equidigital number, since it uses as much as digits as its factorization.
100405113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 712143.
The product of its (nonzero) digits is 60, while the sum is 15.
The square root of 100405113 is about 10020.2351768808. The cubic root of 100405113 is about 464.7848281851.
Adding to 100405113 its reverse (311504001), we get a palindrome (411909114).
The spelling of 100405113 in words is "one hundred million, four hundred five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •