Base | Representation |
---|---|
bin | 100011000011… |
… | …1000110010101 |
3 | 1021120202110112 |
4 | 1012013012111 |
5 | 14201113112 |
6 | 1453532405 |
7 | 312135356 |
oct | 106070625 |
9 | 37522415 |
10 | 18379157 |
11 | a413595 |
12 | 61a4105 |
13 | 3a66754 |
14 | 2625d2d |
15 | 1930a22 |
hex | 1187195 |
18379157 has 4 divisors (see below), whose sum is σ = 18387840. Its totient is φ = 18370476.
The previous prime is 18379147. The next prime is 18379171. The reversal of 18379157 is 75197381.
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 a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 75197381 = 7 ⋅10742483.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-18379157 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (18379147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1148 + ... + 6170.
It is an arithmetic number, because the mean of its divisors is an integer number (4596960).
Almost surely, 218379157 is an apocalyptic number.
It is an amenable number.
18379157 is a deficient number, since it is larger than the sum of its proper divisors (8683).
18379157 is an equidigital number, since it uses as much as digits as its factorization.
18379157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8682.
The product of its digits is 52920, while the sum is 41.
The square root of 18379157 is about 4287.0919047765. The cubic root of 18379157 is about 263.9015023202.
The spelling of 18379157 in words is "eighteen million, three hundred seventy-nine thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •