Base | Representation |
---|---|
bin | 110111000101011100… |
… | …110110001010010001 |
3 | 12122200001222112021221 |
4 | 313011130312022101 |
5 | 1432113143421043 |
6 | 43101042445041 |
7 | 4162503213031 |
oct | 670534661221 |
9 | 178601875257 |
10 | 59147248273 |
11 | 230a2097073 |
12 | b568363781 |
13 | 5767b97579 |
14 | 2c115158c1 |
15 | 181295a8ed |
hex | dc5736291 |
59147248273 has 6 divisors (see below), whose sum is σ = 62424104514. Its totient is φ = 56034234864.
The previous prime is 59147248271. The next prime is 59147248289. The reversal of 59147248273 is 37284274195.
59147248273 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 53055133569 + 6092114704 = 230337^2 + 78052^2 .
It is not a de Polignac number, because 59147248273 - 21 = 59147248271 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 59147248273.
It is not an unprimeable number, because it can be changed into a prime (59147248271) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 81921036 + ... + 81921757.
It is an arithmetic number, because the mean of its divisors is an integer number (10404017419).
Almost surely, 259147248273 is an apocalyptic number.
It is an amenable number.
59147248273 is a deficient number, since it is larger than the sum of its proper divisors (3276856241).
59147248273 is a wasteful number, since it uses less digits than its factorization.
59147248273 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 163842831 (or 163842812 counting only the distinct ones).
The product of its digits is 3386880, while the sum is 52.
The spelling of 59147248273 in words is "fifty-nine billion, one hundred forty-seven million, two hundred forty-eight thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •