Base | Representation |
---|---|
bin | 10100010011101000110101… |
… | …100010100001101100000001 |
3 | 102201012222212200201020122201 |
4 | 110103220311202201230001 |
5 | 43201230244214240403 |
6 | 513540353053233201 |
7 | 24545316110041156 |
oct | 2423506542415401 |
9 | 381188780636581 |
10 | 89310448196353 |
11 | 2650339176308a |
12 | a024b68492801 |
13 | 3aaac293559c7 |
14 | 180a91229022d |
15 | a4d282bb621d |
hex | 513a358a1b01 |
89310448196353 has 4 divisors (see below), whose sum is σ = 89311002162480. Its totient is φ = 89309894230228.
The previous prime is 89310448196293. The next prime is 89310448196419. The reversal of 89310448196353 is 35369184401398.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 89310448196353 - 233 = 89301858261761 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (89310448166353) 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 in 3 ways as a sum of consecutive naturals, for example, 276741163 + ... + 277063696.
It is an arithmetic number, because the mean of its divisors is an integer number (22327750540620).
Almost surely, 289310448196353 is an apocalyptic number.
It is an amenable number.
89310448196353 is a deficient number, since it is larger than the sum of its proper divisors (553966127).
89310448196353 is a wasteful number, since it uses less digits than its factorization.
89310448196353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 553966126.
The product of its (nonzero) digits is 67184640, while the sum is 64.
The spelling of 89310448196353 in words is "eighty-nine trillion, three hundred ten billion, four hundred forty-eight million, one hundred ninety-six thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •