Base | Representation |
---|---|
bin | 100111000100… |
… | …010100000001 |
3 | 201021022101201 |
4 | 213010110001 |
5 | 10110210111 |
6 | 1003301201 |
7 | 153022651 |
oct | 47042401 |
9 | 21238351 |
10 | 10241281 |
11 | 5865476 |
12 | 351a801 |
13 | 217763b |
14 | 1508361 |
15 | d746c1 |
hex | 9c4501 |
10241281 has 2 divisors, whose sum is σ = 10241282. Its totient is φ = 10241280.
The previous prime is 10241269. The next prime is 10241317. The reversal of 10241281 is 18214201.
It is a happy number.
10241281 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10112400 + 128881 = 3180^2 + 359^2 .
It is an emirp because it is prime and its reverse (18214201) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10241281 is a prime.
It is a super-2 number, since 2×102412812 = 209767673041922, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10241201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5120640 + 5120641.
It is an arithmetic number, because the mean of its divisors is an integer number (5120641).
Almost surely, 210241281 is an apocalyptic number.
It is an amenable number.
10241281 is a deficient number, since it is larger than the sum of its proper divisors (1).
10241281 is an equidigital number, since it uses as much as digits as its factorization.
10241281 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 128, while the sum is 19.
The square root of 10241281 is about 3200.2001499906. The cubic root of 10241281 is about 217.1624640775.
Adding to 10241281 its reverse (18214201), we get a palindrome (28455482).
The spelling of 10241281 in words is "ten million, two hundred forty-one thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •