Base | Representation |
---|---|
bin | 100111001101100101010… |
… | …1100101100001010011111 |
3 | 201002012200212100222200001 |
4 | 1032123022230230022133 |
5 | 1201244231130431142 |
6 | 15243445553515131 |
7 | 1064235423426526 |
oct | 116331254541237 |
9 | 21065625328601 |
10 | 5389289702047 |
11 | 17986485a1549 |
12 | 730592272aa7 |
13 | 30129180b6a4 |
14 | 148bb332b4bd |
15 | 952c3c035b7 |
hex | 4e6cab2c29f |
5389289702047 has 4 divisors (see below), whose sum is σ = 5408333128840. Its totient is φ = 5370246275256.
The previous prime is 5389289702029. The next prime is 5389289702051. The reversal of 5389289702047 is 7402079829835.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5389289702047 - 211 = 5389289699999 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5389289702047.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5389289702947) 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 in 3 ways as a sum of consecutive naturals, for example, 9521712972 + ... + 9521713537.
It is an arithmetic number, because the mean of its divisors is an integer number (1352083282210).
Almost surely, 25389289702047 is an apocalyptic number.
5389289702047 is a deficient number, since it is larger than the sum of its proper divisors (19043426793).
5389289702047 is a wasteful number, since it uses less digits than its factorization.
5389289702047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19043426792.
The product of its (nonzero) digits is 60963840, while the sum is 64.
The spelling of 5389289702047 in words is "five trillion, three hundred eighty-nine billion, two hundred eighty-nine million, seven hundred two thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •