Search a number
-
+
69031961021 = 292380412449
BaseRepresentation
bin100000001001010100…
…0000010000110111101
320121011221210222001002
41000102220002012331
52112334140223041
651413550300045
74662450662402
oct1002250020675
9217157728032
1069031961021
1127304819061
12114667b7625
136681a1ac1a
1434ac2282a9
151be064459b
hex1012a021bd

69031961021 has 4 divisors (see below), whose sum is σ = 71412373500. Its totient is φ = 66651548544.

The previous prime is 69031961017. The next prime is 69031961051. The reversal of 69031961021 is 12016913096.

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 52952452996 + 16079508025 = 230114^2 + 126805^2 .

It is a cyclic number.

It is not a de Polignac number, because 69031961021 - 22 = 69031961017 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (69031961051) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1190206196 + ... + 1190206253.

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

Almost surely, 269031961021 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2380412478.

The product of its (nonzero) digits is 17496, while the sum is 38.

The spelling of 69031961021 in words is "sixty-nine billion, thirty-one million, nine hundred sixty-one thousand, twenty-one".

Divisors: 1 29 2380412449 69031961021