Base | Representation |
---|---|
bin | 110001101011… |
… | …101000010001 |
3 | 220111200020112 |
4 | 301223220101 |
5 | 11313230021 |
6 | 1143051105 |
7 | 215462102 |
oct | 61535021 |
9 | 26450215 |
10 | 13023761 |
11 | 7395a43 |
12 | 4440a95 |
13 | 290cc8a |
14 | 1a303a9 |
15 | 1223d5b |
hex | c6ba11 |
13023761 has 2 divisors, whose sum is σ = 13023762. Its totient is φ = 13023760.
The previous prime is 13023737. The next prime is 13023763. The reversal of 13023761 is 16732031.
It is a happy number.
13023761 is digitally balanced in base 3, 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., 9579025 + 3444736 = 3095^2 + 1856^2 .
It is a cyclic number.
It is not a de Polignac number, because 13023761 - 214 = 13007377 is a prime.
Together with 13023763, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (13023763) 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, 6511880 + 6511881.
It is an arithmetic number, because the mean of its divisors is an integer number (6511881).
Almost surely, 213023761 is an apocalyptic number.
It is an amenable number.
13023761 is a deficient number, since it is larger than the sum of its proper divisors (1).
13023761 is an equidigital number, since it uses as much as digits as its factorization.
13023761 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 756, while the sum is 23.
The square root of 13023761 is about 3608.8448290277. The cubic root of 13023761 is about 235.2766381537.
Adding to 13023761 its reverse (16732031), we get a palindrome (29755792).
The spelling of 13023761 in words is "thirteen million, twenty-three thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •