Base | Representation |
---|---|
bin | 100111111111… |
… | …011000111101 |
3 | 201201121022221 |
4 | 213333120331 |
5 | 10140431021 |
6 | 1012405341 |
7 | 155051305 |
oct | 47773075 |
9 | 21647287 |
10 | 10483261 |
11 | 5a10258 |
12 | 3616851 |
13 | 2230819 |
14 | 156c605 |
15 | dc1241 |
hex | 9ff63d |
10483261 has 2 divisors, whose sum is σ = 10483262. Its totient is φ = 10483260.
The previous prime is 10483229. The next prime is 10483273. The reversal of 10483261 is 16238401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9114361 + 1368900 = 3019^2 + 1170^2 .
It is an emirp because it is prime and its reverse (16238401) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10483261 - 25 = 10483229 is a prime.
It is a super-2 number, since 2×104832612 = 219797522388242, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10483201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5241630 + 5241631.
It is an arithmetic number, because the mean of its divisors is an integer number (5241631).
Almost surely, 210483261 is an apocalyptic number.
It is an amenable number.
10483261 is a deficient number, since it is larger than the sum of its proper divisors (1).
10483261 is an equidigital number, since it uses as much as digits as its factorization.
10483261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 25.
The square root of 10483261 is about 3237.7864352054. The cubic root of 10483261 is about 218.8595319762.
The spelling of 10483261 in words is "ten million, four hundred eighty-three thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •