Base | Representation |
---|---|
bin | 11001001010011100101010… |
… | …00011110010100100101111 |
3 | 21020220221011221100120200211 |
4 | 30211032111003302210233 |
5 | 24223100142001120020 |
6 | 313404203055403251 |
7 | 14440535043322423 |
oct | 1445162503624457 |
9 | 236827157316624 |
10 | 55334564473135 |
11 | 166a4291092122 |
12 | 6258261823527 |
13 | 24b50475396bc |
14 | d942c882ab83 |
15 | 65e5a424085a |
hex | 3253950f292f |
55334564473135 has 32 divisors (see below), whose sum is σ = 68103437157504. Its totient is φ = 43135648512000.
The previous prime is 55334564473099. The next prime is 55334564473163. The reversal of 55334564473135 is 53137446543355.
55334564473135 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 55334564473135 - 27 = 55334564473007 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 55334564473135.
It is a congruent number.
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 31 ways as a sum of consecutive naturals, for example, 941979865 + ... + 942038605.
It is an arithmetic number, because the mean of its divisors is an integer number (2128232411172).
Almost surely, 255334564473135 is an apocalyptic number.
55334564473135 is a deficient number, since it is larger than the sum of its proper divisors (12768872684369).
55334564473135 is a wasteful number, since it uses less digits than its factorization.
55334564473135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64275.
The product of its digits is 136080000, while the sum is 58.
The spelling of 55334564473135 in words is "fifty-five trillion, three hundred thirty-four billion, five hundred sixty-four million, four hundred seventy-three thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •