Base | Representation |
---|---|
bin | 101000001101… |
… | …011101110001 |
3 | 201211112102012 |
4 | 220031131301 |
5 | 10144302123 |
6 | 1013532305 |
7 | 155411345 |
oct | 50153561 |
9 | 21745365 |
10 | 10540913 |
11 | 5a4a5a9 |
12 | 3644095 |
13 | 2250b36 |
14 | 1585625 |
15 | dd3378 |
hex | a0d771 |
10540913 has 2 divisors, whose sum is σ = 10540914. Its totient is φ = 10540912.
The previous prime is 10540903. The next prime is 10540919. The reversal of 10540913 is 31904501.
It is a happy number.
10540913 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7795264 + 2745649 = 2792^2 + 1657^2 .
It is an emirp because it is prime and its reverse (31904501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10540913 - 212 = 10536817 is a prime.
It is a super-2 number, since 2×105409132 = 222221693747138, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10540919) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5270456 + 5270457.
It is an arithmetic number, because the mean of its divisors is an integer number (5270457).
Almost surely, 210540913 is an apocalyptic number.
It is an amenable number.
10540913 is a deficient number, since it is larger than the sum of its proper divisors (1).
10540913 is an equidigital number, since it uses as much as digits as its factorization.
10540913 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 540, while the sum is 23.
The square root of 10540913 is about 3246.6772244866. The cubic root of 10540913 is about 219.2599999253.
Adding to 10540913 its sum of digits (23), we get a triangular number (10540936 = T4591).
The spelling of 10540913 in words is "ten million, five hundred forty thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •