Base | Representation |
---|---|
bin | 111001110000… |
… | …100011111001 |
3 | 1001111020200222 |
4 | 321300203321 |
5 | 12334003423 |
6 | 1300305425 |
7 | 242461121 |
oct | 71604371 |
9 | 31436628 |
10 | 15141113 |
11 | 8601819 |
12 | 50a2275 |
13 | 31a1950 |
14 | 2021c81 |
15 | 14e13c8 |
hex | e708f9 |
15141113 has 8 divisors (see below), whose sum is σ = 16832256. Its totient is φ = 13525200.
The previous prime is 15141089. The next prime is 15141121. The reversal of 15141113 is 31114151.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-15141113 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 15141091 and 15141100.
It is not an unprimeable number, because it can be changed into a prime (15141163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18383 + ... + 19188.
It is an arithmetic number, because the mean of its divisors is an integer number (2104032).
Almost surely, 215141113 is an apocalyptic number.
15141113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
15141113 is a deficient number, since it is larger than the sum of its proper divisors (1691143).
15141113 is a wasteful number, since it uses less digits than its factorization.
15141113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37615.
The product of its digits is 60, while the sum is 17.
The square root of 15141113 is about 3891.1583108375. The cubic root of 15141113 is about 247.3921606175.
Adding to 15141113 its reverse (31114151), we get a palindrome (46255264).
The spelling of 15141113 in words is "fifteen million, one hundred forty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •