Base | Representation |
---|---|
bin | 10010001101111111… |
… | …00001000111100001 |
3 | 221020122122210110221 |
4 | 21012333201013201 |
5 | 130012413143213 |
6 | 4254320323041 |
7 | 464245022044 |
oct | 110677410741 |
9 | 27218583427 |
10 | 9780990433 |
11 | 416a128975 |
12 | 1a8b773481 |
13 | bcb508806 |
14 | 68b032c5b |
15 | 3c3a4b38d |
hex | 246fe11e1 |
9780990433 has 2 divisors, whose sum is σ = 9780990434. Its totient is φ = 9780990432.
The previous prime is 9780990431. The next prime is 9780990469. The reversal of 9780990433 is 3340990879.
9780990433 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5666024529 + 4114965904 = 75273^2 + 64148^2 .
It is a cyclic number.
It is not a de Polignac number, because 9780990433 - 21 = 9780990431 is a prime.
Together with 9780990431, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (9780990431) 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, 4890495216 + 4890495217.
It is an arithmetic number, because the mean of its divisors is an integer number (4890495217).
Almost surely, 29780990433 is an apocalyptic number.
It is an amenable number.
9780990433 is a deficient number, since it is larger than the sum of its proper divisors (1).
9780990433 is an equidigital number, since it uses as much as digits as its factorization.
9780990433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1469664, while the sum is 52.
The square root of 9780990433 is about 98898.8899482699. The cubic root of 9780990433 is about 2138.5903921228.
The spelling of 9780990433 in words is "nine billion, seven hundred eighty million, nine hundred ninety thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •