Base | Representation |
---|---|
bin | 111100100010100… |
… | …101001101000001 |
3 | 2121210012211001101 |
4 | 330202211031001 |
5 | 4040004320431 |
6 | 244441534401 |
7 | 34112202235 |
oct | 7442451501 |
9 | 2553184041 |
10 | 1015698241 |
11 | 481376138 |
12 | 2441a4401 |
13 | 13257559c |
14 | 98c765c5 |
15 | 5e282961 |
hex | 3c8a5341 |
1015698241 has 2 divisors, whose sum is σ = 1015698242. Its totient is φ = 1015698240.
The previous prime is 1015698223. The next prime is 1015698259. The reversal of 1015698241 is 1428965101.
It is a balanced prime because it is at equal distance from previous prime (1015698223) and next prime (1015698259).
It can be written as a sum of positive squares in only one way, i.e., 844193025 + 171505216 = 29055^2 + 13096^2 .
It is a cyclic number.
It is not a de Polignac number, because 1015698241 - 225 = 982143809 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1015698241.
It is not a weakly prime, because it can be changed into another prime (1015698641) 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 as a sum of consecutive naturals, namely, 507849120 + 507849121.
It is an arithmetic number, because the mean of its divisors is an integer number (507849121).
Almost surely, 21015698241 is an apocalyptic number.
It is an amenable number.
1015698241 is a deficient number, since it is larger than the sum of its proper divisors (1).
1015698241 is an equidigital number, since it uses as much as digits as its factorization.
1015698241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17280, while the sum is 37.
The square root of 1015698241 is about 31870.0210385873. The cubic root of 1015698241 is about 1005.2056016901.
The spelling of 1015698241 in words is "one billion, fifteen million, six hundred ninety-eight thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •