Base | Representation |
---|---|
bin | 110000100010… |
… | …001110011101 |
3 | 212221101210222 |
4 | 300202032131 |
5 | 11224114401 |
6 | 1132411125 |
7 | 213100406 |
oct | 60421635 |
9 | 25841728 |
10 | 12723101 |
11 | 7200066 |
12 | 4316aa5 |
13 | 2836181 |
14 | 19929ad |
15 | 11b4c1b |
hex | c2239d |
12723101 has 2 divisors, whose sum is σ = 12723102. Its totient is φ = 12723100.
The previous prime is 12723091. The next prime is 12723107. The reversal of 12723101 is 10132721.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9211225 + 3511876 = 3035^2 + 1874^2 .
It is an emirp because it is prime and its reverse (10132721) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12723101 - 214 = 12706717 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12723101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12723107) 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, 6361550 + 6361551.
It is an arithmetic number, because the mean of its divisors is an integer number (6361551).
Almost surely, 212723101 is an apocalyptic number.
It is an amenable number.
12723101 is a deficient number, since it is larger than the sum of its proper divisors (1).
12723101 is an equidigital number, since it uses as much as digits as its factorization.
12723101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84, while the sum is 17.
The square root of 12723101 is about 3566.9456121449. The cubic root of 12723101 is about 233.4520318971.
Adding to 12723101 its reverse (10132721), we get a palindrome (22855822).
The spelling of 12723101 in words is "twelve million, seven hundred twenty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •