Base | Representation |
---|---|
bin | 111100100000011… |
… | …110001100000101 |
3 | 2121202011201110011 |
4 | 330200132030011 |
5 | 4034334121341 |
6 | 244422030221 |
7 | 34104410026 |
oct | 7440361405 |
9 | 2552151404 |
10 | 1015145221 |
11 | 4810286a2 |
12 | 243b78371 |
13 | 13241095c |
14 | 98b70c4d |
15 | 5e1c3b81 |
hex | 3c81e305 |
1015145221 has 2 divisors, whose sum is σ = 1015145222. Its totient is φ = 1015145220.
The previous prime is 1015145213. The next prime is 1015145249. The reversal of 1015145221 is 1225415101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 766736100 + 248409121 = 27690^2 + 15761^2 .
It is a cyclic number.
It is not a de Polignac number, because 1015145221 - 23 = 1015145213 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1015145192 and 1015145201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1015140221) 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, 507572610 + 507572611.
It is an arithmetic number, because the mean of its divisors is an integer number (507572611).
Almost surely, 21015145221 is an apocalyptic number.
It is an amenable number.
1015145221 is a deficient number, since it is larger than the sum of its proper divisors (1).
1015145221 is an equidigital number, since it uses as much as digits as its factorization.
1015145221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 400, while the sum is 22.
The square root of 1015145221 is about 31861.3436785080. The cubic root of 1015145221 is about 1005.0231328883.
The spelling of 1015145221 in words is "one billion, fifteen million, one hundred forty-five thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •