Base | Representation |
---|---|
bin | 11010110111011110101110… |
… | …11111001010110000110111 |
3 | 21202012002002211120121201102 |
4 | 31123233113133022300313 |
5 | 30220440130422202341 |
6 | 325353215242320315 |
7 | 15305311353453362 |
oct | 1533572737126067 |
9 | 252162084517642 |
10 | 59080890428471 |
11 | 1790907945839a |
12 | 67623327b909b |
13 | 26c73c503c612 |
14 | 108375d4130d9 |
15 | 6c6c69a95c9b |
hex | 35bbd77cac37 |
59080890428471 has 16 divisors (see below), whose sum is σ = 59724218419200. Its totient is φ = 58440986554080.
The previous prime is 59080890428459. The next prime is 59080890428479. The reversal of 59080890428471 is 17482409808095.
It is a cyclic number.
It is not a de Polignac number, because 59080890428471 - 218 = 59080890166327 is a prime.
It is a super-3 number, since 3×590808904284713 (a number of 42 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 59080890428398 and 59080890428407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (59080890428479) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 460070930 + ... + 460199328.
It is an arithmetic number, because the mean of its divisors is an integer number (3732763651200).
Almost surely, 259080890428471 is an apocalyptic number.
59080890428471 is a deficient number, since it is larger than the sum of its proper divisors (643327990729).
59080890428471 is a wasteful number, since it uses less digits than its factorization.
59080890428471 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 141694.
The product of its (nonzero) digits is 46448640, while the sum is 65.
The spelling of 59080890428471 in words is "fifty-nine trillion, eighty billion, eight hundred ninety million, four hundred twenty-eight thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •