Base | Representation |
---|---|
bin | 11011000011010111110101… |
… | …10000101010111010001000 |
3 | 21210122010210211022110111220 |
4 | 31201223322300222322020 |
5 | 30244134001023043024 |
6 | 330305033443522040 |
7 | 15346655240455212 |
oct | 1541537260527210 |
9 | 253563724273456 |
10 | 59489504112264 |
11 | 17a563a2201926 |
12 | 680956a689320 |
13 | 2726ab409ab75 |
14 | 10994435895b2 |
15 | 6d26d27abe79 |
hex | 361afac2ae88 |
59489504112264 has 32 divisors (see below), whose sum is σ = 148744385281440. Its totient is φ = 19827084704000.
The previous prime is 59489504112251. The next prime is 59489504112281. The reversal of 59489504112264 is 46221140598495.
59489504112264 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 59489504112198 and 59489504112207.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 171698337 + ... + 172044464.
It is an arithmetic number, because the mean of its divisors is an integer number (4648262040045).
Almost surely, 259489504112264 is an apocalyptic number.
It is an amenable number.
59489504112264 is an abundant number, since it is smaller than the sum of its proper divisors (89254881169176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
59489504112264 is a wasteful number, since it uses less digits than its factorization.
59489504112264 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 343750021 (or 343750017 counting only the distinct ones).
The product of its (nonzero) digits is 24883200, while the sum is 60.
The spelling of 59489504112264 in words is "fifty-nine trillion, four hundred eighty-nine billion, five hundred four million, one hundred twelve thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •