Base | Representation |
---|---|
bin | 110111000101000010… |
… | …001100000000001101 |
3 | 12122122120211110222120 |
4 | 313011002030000031 |
5 | 1432104401303403 |
6 | 43100233003153 |
7 | 4162356625443 |
oct | 670502140015 |
9 | 178576743876 |
10 | 59140259853 |
11 | 23099153614 |
12 | b565b534b9 |
13 | 57665bb6cc |
14 | 2c10616b93 |
15 | 1812029e53 |
hex | dc508c00d |
59140259853 has 16 divisors (see below), whose sum is σ = 79002604800. Its totient is φ = 39352444160.
The previous prime is 59140259839. The next prime is 59140259887. The reversal of 59140259853 is 35895204195.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 59140259853 - 210 = 59140258829 is a prime.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 59140259796 and 59140259805.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (59140259653) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4169788 + ... + 4183946.
It is an arithmetic number, because the mean of its divisors is an integer number (4937662800).
Almost surely, 259140259853 is an apocalyptic number.
It is an amenable number.
59140259853 is a deficient number, since it is larger than the sum of its proper divisors (19862344947).
59140259853 is a wasteful number, since it uses less digits than its factorization.
59140259853 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16692.
The product of its (nonzero) digits is 1944000, while the sum is 51.
The spelling of 59140259853 in words is "fifty-nine billion, one hundred forty million, two hundred fifty-nine thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •