Search a number
-
+
69214389553 = 673102844561
BaseRepresentation
bin100000001110101111…
…1111100010100110001
320121122200002021221101
41000131133330110301
52113222340431203
651444024324401
75000124414121
oct1003537742461
9217580067841
1069214389553
112739879a341
12114b7913701
1366b07622ba
1434c8554c81
151c0167c41d
hex101d7fc531

69214389553 has 4 divisors (see below), whose sum is σ = 69317234788. Its totient is φ = 69111544320.

The previous prime is 69214389529. The next prime is 69214389599. The reversal of 69214389553 is 35598341296.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 46659456064 + 22554933489 = 216008^2 + 150183^2 .

It is a cyclic number.

It is not a de Polignac number, because 69214389553 - 213 = 69214381361 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 69214389494 and 69214389503.

It is not an unprimeable number, because it can be changed into a prime (69214689553) 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 3 ways as a sum of consecutive naturals, for example, 51421608 + ... + 51422953.

It is an arithmetic number, because the mean of its divisors is an integer number (17329308697).

Almost surely, 269214389553 is an apocalyptic number.

It is an amenable number.

69214389553 is a deficient number, since it is larger than the sum of its proper divisors (102845235).

69214389553 is a wasteful number, since it uses less digits than its factorization.

69214389553 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 102845234.

The product of its digits is 6998400, while the sum is 55.

The spelling of 69214389553 in words is "sixty-nine billion, two hundred fourteen million, three hundred eighty-nine thousand, five hundred fifty-three".

Divisors: 1 673 102844561 69214389553