Base | Representation |
---|---|
bin | 11100110010001100011… |
… | …00111110110110111001 |
3 | 10111112211112011011221112 |
4 | 32121012030332312321 |
5 | 112201003143131033 |
6 | 2034203305050105 |
7 | 131311562504126 |
oct | 16310614766671 |
9 | 3445745134845 |
10 | 989020286393 |
11 | 351494193617 |
12 | 13b818a86935 |
13 | 72358624a99 |
14 | 35c2413774d |
15 | 1aad7882c48 |
hex | e64633edb9 |
989020286393 has 2 divisors, whose sum is σ = 989020286394. Its totient is φ = 989020286392.
The previous prime is 989020286341. The next prime is 989020286503. The reversal of 989020286393 is 393682020989.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 968673260944 + 20347025449 = 984212^2 + 142643^2 .
It is an emirp because it is prime and its reverse (393682020989) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 989020286393 - 26 = 989020286329 is a prime.
It is a super-2 number, since 2×9890202863932 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (989020286593) 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, 494510143196 + 494510143197.
It is an arithmetic number, because the mean of its divisors is an integer number (494510143197).
Almost surely, 2989020286393 is an apocalyptic number.
It is an amenable number.
989020286393 is a deficient number, since it is larger than the sum of its proper divisors (1).
989020286393 is an equidigital number, since it uses as much as digits as its factorization.
989020286393 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10077696, while the sum is 59.
The spelling of 989020286393 in words is "nine hundred eighty-nine billion, twenty million, two hundred eighty-six thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •