Base | Representation |
---|---|
bin | 10011001100010101… |
… | …01100000100011101 |
3 | 222121002211001222022 |
4 | 21212022230010131 |
5 | 132100311400243 |
6 | 4422242425525 |
7 | 513225442661 |
oct | 114612540435 |
9 | 28532731868 |
10 | 10304012573 |
11 | 440838a178 |
12 | 1bb69622a5 |
13 | c8299177a |
14 | 6da69c8a1 |
15 | 404910b68 |
hex | 2662ac11d |
10304012573 has 2 divisors, whose sum is σ = 10304012574. Its totient is φ = 10304012572.
The previous prime is 10304012549. The next prime is 10304012597. The reversal of 10304012573 is 37521040301.
It is a balanced prime because it is at equal distance from previous prime (10304012549) and next prime (10304012597).
It can be written as a sum of positive squares in only one way, i.e., 5793949924 + 4510062649 = 76118^2 + 67157^2 .
It is an emirp because it is prime and its reverse (37521040301) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10304012573 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 (10304012513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5152006286 + 5152006287.
It is an arithmetic number, because the mean of its divisors is an integer number (5152006287).
Almost surely, 210304012573 is an apocalyptic number.
It is an amenable number.
10304012573 is a deficient number, since it is larger than the sum of its proper divisors (1).
10304012573 is an equidigital number, since it uses as much as digits as its factorization.
10304012573 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2520, while the sum is 26.
Adding to 10304012573 its reverse (37521040301), we get a palindrome (47825052874).
The spelling of 10304012573 in words is "ten billion, three hundred four million, twelve thousand, five hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •