Base | Representation |
---|---|
bin | 10011001100010111… |
… | …10100111100110101 |
3 | 222121010101020110121 |
4 | 21212023310330311 |
5 | 132100400423333 |
6 | 4422253051541 |
7 | 513231125206 |
oct | 114613647465 |
9 | 28533336417 |
10 | 10304311093 |
11 | 440857348a |
12 | 1bb6a86bb1 |
13 | c82a675cb |
14 | 6da7395ad |
15 | 40496e32d |
hex | 2662f4f35 |
10304311093 has 2 divisors, whose sum is σ = 10304311094. Its totient is φ = 10304311092.
The previous prime is 10304311091. The next prime is 10304311169. The reversal of 10304311093 is 39011340301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7524174564 + 2780136529 = 86742^2 + 52727^2 .
It is an emirp because it is prime and its reverse (39011340301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10304311093 - 21 = 10304311091 is a prime.
Together with 10304311091, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10304311091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5152155546 + 5152155547.
It is an arithmetic number, because the mean of its divisors is an integer number (5152155547).
Almost surely, 210304311093 is an apocalyptic number.
It is an amenable number.
10304311093 is a deficient number, since it is larger than the sum of its proper divisors (1).
10304311093 is an equidigital number, since it uses as much as digits as its factorization.
10304311093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 10304311093 its reverse (39011340301), we get a palindrome (49315651394).
The spelling of 10304311093 in words is "ten billion, three hundred four million, three hundred eleven thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •