Base | Representation |
---|---|
bin | 1100101101011000001… |
… | …1010110011111000001 |
3 | 202212120110102020122010 |
4 | 3023112003112133001 |
5 | 12034124412130203 |
6 | 244145342403133 |
7 | 21526441462662 |
oct | 3132603263701 |
9 | 685513366563 |
10 | 218339567553 |
11 | 84662aa27a8 |
12 | 363955904a9 |
13 | 177879c22b3 |
14 | a7d3a61369 |
15 | 5a2d555303 |
hex | 32d60d67c1 |
218339567553 has 32 divisors (see below), whose sum is σ = 311854147200. Its totient is φ = 135468633600.
The previous prime is 218339567543. The next prime is 218339567557. The reversal of 218339567553 is 355765933812.
218339567553 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 218339567553 - 26 = 218339567489 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is a junction number, because it is equal to n+sod(n) for n = 218339567493 and 218339567502.
It is not an unprimeable number, because it can be changed into a prime (218339567557) 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 31 ways as a sum of consecutive naturals, for example, 2774083 + ... + 2851703.
It is an arithmetic number, because the mean of its divisors is an integer number (9745442100).
Almost surely, 2218339567553 is an apocalyptic number.
It is an amenable number.
218339567553 is a deficient number, since it is larger than the sum of its proper divisors (93514579647).
218339567553 is a wasteful number, since it uses less digits than its factorization.
218339567553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78513.
The product of its digits is 20412000, while the sum is 57.
The spelling of 218339567553 in words is "two hundred eighteen billion, three hundred thirty-nine million, five hundred sixty-seven thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •