Base | Representation |
---|---|
bin | 1001100010101101… |
… | …01101001101001101 |
3 | 111020000211112020202 |
4 | 10301112231031031 |
5 | 40442442100323 |
6 | 2204203423245 |
7 | 240644544266 |
oct | 46126551515 |
9 | 14200745222 |
10 | 5123003213 |
11 | 2199890159 |
12 | bab824b25 |
13 | 638497763 |
14 | 36855d96d |
15 | 1eeb51d28 |
hex | 1315ad34d |
5123003213 has 2 divisors, whose sum is σ = 5123003214. Its totient is φ = 5123003212.
The previous prime is 5123003209. The next prime is 5123003219. The reversal of 5123003213 is 3123003215.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2998438564 + 2124564649 = 54758^2 + 46093^2 .
It is a cyclic number.
It is not a de Polignac number, because 5123003213 - 22 = 5123003209 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5123003219) 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, 2561501606 + 2561501607.
It is an arithmetic number, because the mean of its divisors is an integer number (2561501607).
Almost surely, 25123003213 is an apocalyptic number.
It is an amenable number.
5123003213 is a deficient number, since it is larger than the sum of its proper divisors (1).
5123003213 is an equidigital number, since it uses as much as digits as its factorization.
5123003213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 540, while the sum is 20.
The square root of 5123003213 is about 71575.1577923514. The cubic root of 5123003213 is about 1723.8846771094.
Adding to 5123003213 its reverse (3123003215), we get a palindrome (8246006428).
The spelling of 5123003213 in words is "five billion, one hundred twenty-three million, three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •