Base | Representation |
---|---|
bin | 100110101110… |
… | …001010100001 |
3 | 201002200221201 |
4 | 212232022201 |
5 | 10044304221 |
6 | 1001321201 |
7 | 152164321 |
oct | 46561241 |
9 | 21080851 |
10 | 10150561 |
11 | 58032a3 |
12 | 3496201 |
13 | 2145265 |
14 | 14c3281 |
15 | d57891 |
hex | 9ae2a1 |
10150561 has 2 divisors, whose sum is σ = 10150562. Its totient is φ = 10150560.
The previous prime is 10150559. The next prime is 10150573. The reversal of 10150561 is 16505101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9579025 + 571536 = 3095^2 + 756^2 .
It is a cyclic number.
It is not a de Polignac number, because 10150561 - 21 = 10150559 is a prime.
It is a super-2 number, since 2×101505612 = 206067777229442, which contains 22 as substring.
Together with 10150559, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (10150501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5075280 + 5075281.
It is an arithmetic number, because the mean of its divisors is an integer number (5075281).
Almost surely, 210150561 is an apocalyptic number.
It is an amenable number.
10150561 is a deficient number, since it is larger than the sum of its proper divisors (1).
10150561 is an equidigital number, since it uses as much as digits as its factorization.
10150561 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 150, while the sum is 19.
The square root of 10150561 is about 3185.9945072143. The cubic root of 10150561 is about 216.5193336300.
Adding to 10150561 its reverse (16505101), we get a palindrome (26655662).
The spelling of 10150561 in words is "ten million, one hundred fifty thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •