Base | Representation |
---|---|
bin | 1001110000110001… |
… | …11100111000010101 |
3 | 111112020221000121012 |
4 | 10320120330320111 |
5 | 41213201012323 |
6 | 2224021302005 |
7 | 243610016204 |
oct | 47030747025 |
9 | 14466830535 |
10 | 5241032213 |
11 | 224a47608a |
12 | 1023264905 |
13 | 656a814c1 |
14 | 37a0c523b |
15 | 20a1b8678 |
hex | 13863ce15 |
5241032213 has 2 divisors, whose sum is σ = 5241032214. Its totient is φ = 5241032212.
The previous prime is 5241032197. The next prime is 5241032231. The reversal of 5241032213 is 3122301425.
Together with next prime (5241032231) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4835533444 + 405498769 = 69538^2 + 20137^2 .
It is a cyclic number.
It is not a de Polignac number, because 5241032213 - 24 = 5241032197 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 (5241032233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2620516106 + 2620516107.
It is an arithmetic number, because the mean of its divisors is an integer number (2620516107).
Almost surely, 25241032213 is an apocalyptic number.
It is an amenable number.
5241032213 is a deficient number, since it is larger than the sum of its proper divisors (1).
5241032213 is an equidigital number, since it uses as much as digits as its factorization.
5241032213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1440, while the sum is 23.
The square root of 5241032213 is about 72394.9736722101. The cubic root of 5241032213 is about 1737.0231626849.
Adding to 5241032213 its reverse (3122301425), we get a palindrome (8363333638).
The spelling of 5241032213 in words is "five billion, two hundred forty-one million, thirty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •