Base | Representation |
---|---|
bin | 101111110011… |
… | …110100111011 |
3 | 212120202010002 |
4 | 233303310323 |
5 | 11202024201 |
6 | 1124343215 |
7 | 211346336 |
oct | 57636473 |
9 | 25522102 |
10 | 12533051 |
11 | 70902a3 |
12 | 4244b0b |
13 | 279a80b |
14 | 194361d |
15 | 117876b |
hex | bf3d3b |
12533051 has 2 divisors, whose sum is σ = 12533052. Its totient is φ = 12533050.
The previous prime is 12533041. The next prime is 12533071. The reversal of 12533051 is 15033521.
It is an a-pointer prime, because the next prime (12533071) can be obtained adding 12533051 to its sum of digits (20).
It is a weak prime.
It is an emirp because it is prime and its reverse (15033521) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12533051 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (12533041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6266525 + 6266526.
It is an arithmetic number, because the mean of its divisors is an integer number (6266526).
Almost surely, 212533051 is an apocalyptic number.
12533051 is a deficient number, since it is larger than the sum of its proper divisors (1).
12533051 is an equidigital number, since it uses as much as digits as its factorization.
12533051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 450, while the sum is 20.
The square root of 12533051 is about 3540.2049375707. The cubic root of 12533051 is about 232.2838072035.
Adding to 12533051 its reverse (15033521), we get a palindrome (27566572).
It can be divided in two parts, 125 and 33051, that multiplied together give a triangular number (4131375 = T2874).
The spelling of 12533051 in words is "twelve million, five hundred thirty-three thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •