Base | Representation |
---|---|
bin | 111010101101… |
… | …100011011101 |
3 | 1001221221101212 |
4 | 322231203131 |
5 | 12420002231 |
6 | 1305514205 |
7 | 244551356 |
oct | 72554335 |
9 | 31857355 |
10 | 15390941 |
11 | 8762495 |
12 | 51a2965 |
13 | 325b587 |
14 | 2088d2d |
15 | 154042b |
hex | ead8dd |
15390941 has 2 divisors, whose sum is σ = 15390942. Its totient is φ = 15390940.
The previous prime is 15390937. The next prime is 15390943. The reversal of 15390941 is 14909351.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13579225 + 1811716 = 3685^2 + 1346^2 .
It is an emirp because it is prime and its reverse (14909351) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 15390941 - 22 = 15390937 is a prime.
Together with 15390943, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 15390898 and 15390907.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (15390943) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7695470 + 7695471.
It is an arithmetic number, because the mean of its divisors is an integer number (7695471).
Almost surely, 215390941 is an apocalyptic number.
It is an amenable number.
15390941 is a deficient number, since it is larger than the sum of its proper divisors (1).
15390941 is an equidigital number, since it uses as much as digits as its factorization.
15390941 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4860, while the sum is 32.
The square root of 15390941 is about 3923.1289808009. The cubic root of 15390941 is about 248.7453997786.
The spelling of 15390941 in words is "fifteen million, three hundred ninety thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •