Base | Representation |
---|---|
bin | 111011000010010… |
… | …001111101101101 |
3 | 2120000201020221011 |
4 | 323002101331231 |
5 | 4012024003423 |
6 | 242140505221 |
7 | 33354500602 |
oct | 7302217555 |
9 | 2500636834 |
10 | 990453613 |
11 | 4690a3506 |
12 | 23784b211 |
13 | 12a276c36 |
14 | 957846a9 |
15 | 5be47b0d |
hex | 3b091f6d |
990453613 has 2 divisors, whose sum is σ = 990453614. Its totient is φ = 990453612.
The previous prime is 990453601. The next prime is 990453631. The reversal of 990453613 is 316354099.
Together with next prime (990453631) 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., 973627209 + 16826404 = 31203^2 + 4102^2 .
It is an emirp because it is prime and its reverse (316354099) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-990453613 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (990453713) 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, 495226806 + 495226807.
It is an arithmetic number, because the mean of its divisors is an integer number (495226807).
Almost surely, 2990453613 is an apocalyptic number.
It is an amenable number.
990453613 is a deficient number, since it is larger than the sum of its proper divisors (1).
990453613 is an equidigital number, since it uses as much as digits as its factorization.
990453613 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 87480, while the sum is 40.
The square root of 990453613 is about 31471.4730033407. The cubic root of 990453613 is about 996.8076910074.
The spelling of 990453613 in words is "nine hundred ninety million, four hundred fifty-three thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •