Base | Representation |
---|---|
bin | 110111111000100101… |
… | …110110000101000101 |
3 | 12201212212110021212212 |
4 | 313320211312011011 |
5 | 1440342320322003 |
6 | 43322132353205 |
7 | 4222662111662 |
oct | 677045660505 |
9 | 181785407785 |
10 | 60005245253 |
11 | 234a243a988 |
12 | b767775805 |
13 | 58738757a5 |
14 | 2c9345aa69 |
15 | 1862e3bdd8 |
hex | df8976145 |
60005245253 has 8 divisors (see below), whose sum is σ = 64405308888. Its totient is φ = 55701886464.
The previous prime is 60005245193. The next prime is 60005245259. The reversal of 60005245253 is 35254250006.
It can be written as a sum of positive squares in 4 ways, for example, as 4626448324 + 55378796929 = 68018^2 + 235327^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 60005245253 - 214 = 60005228869 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (60005245259) 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 7 ways as a sum of consecutive naturals, for example, 24174926 + ... + 24177407.
It is an arithmetic number, because the mean of its divisors is an integer number (8050663611).
Almost surely, 260005245253 is an apocalyptic number.
It is an amenable number.
60005245253 is a deficient number, since it is larger than the sum of its proper divisors (4400063635).
60005245253 is a wasteful number, since it uses less digits than its factorization.
60005245253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48352423.
The product of its (nonzero) digits is 36000, while the sum is 32.
Adding to 60005245253 its reverse (35254250006), we get a palindrome (95259495259).
The spelling of 60005245253 in words is "sixty billion, five million, two hundred forty-five thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •