Base | Representation |
---|---|
bin | 10100011001110001011100… |
… | …001000110000011011000001 |
3 | 102202201021222112121002200022 |
4 | 110121301130020300123001 |
5 | 43230132120123004033 |
6 | 514502151330103225 |
7 | 24620631446642603 |
oct | 2431613410603301 |
9 | 382637875532608 |
10 | 89732002547393 |
11 | 26656146147438 |
12 | a0927b611ab15 |
13 | 3b0b8cb3b08cb |
14 | 18230a2d49173 |
15 | a59206a0e098 |
hex | 519c5c2306c1 |
89732002547393 has 2 divisors, whose sum is σ = 89732002547394. Its totient is φ = 89732002547392.
The previous prime is 89732002547387. The next prime is 89732002547479. The reversal of 89732002547393 is 39374520023798.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 76422004513024 + 13309998034369 = 8741968^2 + 3648287^2 .
It is a cyclic number.
It is not a de Polignac number, because 89732002547393 - 26 = 89732002547329 is a prime.
It is a super-2 number, since 2×897320025473932 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (89732002540393) 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, 44866001273696 + 44866001273697.
It is an arithmetic number, because the mean of its divisors is an integer number (44866001273697).
Almost surely, 289732002547393 is an apocalyptic number.
It is an amenable number.
89732002547393 is a deficient number, since it is larger than the sum of its proper divisors (1).
89732002547393 is an equidigital number, since it uses as much as digits as its factorization.
89732002547393 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 68584320, while the sum is 62.
The spelling of 89732002547393 in words is "eighty-nine trillion, seven hundred thirty-two billion, two million, five hundred forty-seven thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •