Base | Representation |
---|---|
bin | 1000010001000110110111… |
… | …1001110010101001111101 |
3 | 1012011222212100122110122021 |
4 | 2010101231321302221331 |
5 | 2142412302113231243 |
6 | 31155515204320141 |
7 | 1625505353540524 |
oct | 204215571625175 |
9 | 35158770573567 |
10 | 9089994664573 |
11 | 2995055015679 |
12 | 10298509a3051 |
13 | 50c24b8645c4 |
14 | 235d5add54bb |
15 | 10b6b93526ed |
hex | 8446de72a7d |
9089994664573 has 2 divisors, whose sum is σ = 9089994664574. Its totient is φ = 9089994664572.
The previous prime is 9089994664507. The next prime is 9089994664669. The reversal of 9089994664573 is 3754664999809.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7703189313444 + 1386805351129 = 2775462^2 + 1177627^2 .
It is a cyclic number.
It is not a de Polignac number, because 9089994664573 - 225 = 9089961110141 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 9089994664493 and 9089994664502.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (9089994664973) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4544997332286 + 4544997332287.
It is an arithmetic number, because the mean of its divisors is an integer number (4544997332287).
Almost surely, 29089994664573 is an apocalyptic number.
It is an amenable number.
9089994664573 is a deficient number, since it is larger than the sum of its proper divisors (1).
9089994664573 is an equidigital number, since it uses as much as digits as its factorization.
9089994664573 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3174474240, while the sum is 79.
The spelling of 9089994664573 in words is "nine trillion, eighty-nine billion, nine hundred ninety-four million, six hundred sixty-four thousand, five hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •