Base | Representation |
---|---|
bin | 110010100000… |
… | …101100001101 |
3 | 220220201101011 |
4 | 302200230031 |
5 | 11342203401 |
6 | 1151445221 |
7 | 220355536 |
oct | 62405415 |
9 | 26821334 |
10 | 13241101 |
11 | 7524265 |
12 | 4526811 |
13 | 2987b93 |
14 | 1a8968d |
15 | 1268451 |
hex | ca0b0d |
13241101 has 2 divisors, whose sum is σ = 13241102. Its totient is φ = 13241100.
The previous prime is 13241099. The next prime is 13241159. The reversal of 13241101 is 10114231.
13241101 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., 7695076 + 5546025 = 2774^2 + 2355^2 .
It is a cyclic number.
It is not a de Polignac number, because 13241101 - 21 = 13241099 is a prime.
Together with 13241099, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13241161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6620550 + 6620551.
It is an arithmetic number, because the mean of its divisors is an integer number (6620551).
Almost surely, 213241101 is an apocalyptic number.
It is an amenable number.
13241101 is a deficient number, since it is larger than the sum of its proper divisors (1).
13241101 is an equidigital number, since it uses as much as digits as its factorization.
13241101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 13241101 is about 3638.8323676696. The cubic root of 13241101 is about 236.5781870757.
Adding to 13241101 its reverse (10114231), we get a palindrome (23355332).
It can be divided in two parts, 13 and 241101, that multiplied together give a palindrome (3134313).
The spelling of 13241101 in words is "thirteen million, two hundred forty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •