Base | Representation |
---|---|
bin | 111010001000… |
… | …001110101101 |
3 | 1001200011200122 |
4 | 322020032231 |
5 | 12400104221 |
6 | 1302334325 |
7 | 243343556 |
oct | 72101655 |
9 | 31604618 |
10 | 15238061 |
11 | 8668643 |
12 | 512a3a5 |
13 | 3206b07 |
14 | 204932d |
15 | 150eeab |
hex | e883ad |
15238061 has 2 divisors, whose sum is σ = 15238062. Its totient is φ = 15238060.
The previous prime is 15238031. The next prime is 15238063. The reversal of 15238061 is 16083251.
15238061 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12033961 + 3204100 = 3469^2 + 1790^2 .
It is an emirp because it is prime and its reverse (16083251) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 15238061 - 214 = 15221677 is a prime.
Together with 15238063, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 15238061.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (15238063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7619030 + 7619031.
It is an arithmetic number, because the mean of its divisors is an integer number (7619031).
Almost surely, 215238061 is an apocalyptic number.
It is an amenable number.
15238061 is a deficient number, since it is larger than the sum of its proper divisors (1).
15238061 is an equidigital number, since it uses as much as digits as its factorization.
15238061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1440, while the sum is 26.
The square root of 15238061 is about 3903.5959063407. The cubic root of 15238061 is about 247.9190520151.
The spelling of 15238061 in words is "fifteen million, two hundred thirty-eight thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •