Search a number
-
+
609102469481 = 1155372951771
BaseRepresentation
bin10001101110100010101…
…01100001100101101001
32011020012101202102012112
420313101111201211221
534434420213010411
61143452351452105
762002061364632
oct10672125414551
92136171672175
10609102469481
11215356512650
129a06b227035
134559070731c
14216a3130889
1510c9e03ab8b
hex8dd1561969

609102469481 has 4 divisors (see below), whose sum is σ = 664475421264. Its totient is φ = 553729517700.

The previous prime is 609102469457. The next prime is 609102469489. The reversal of 609102469481 is 184964201906.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 609102469481 - 226 = 609035360617 is a prime.

It is a super-2 number, since 2×6091024694812 (a number of 24 digits) contains 22 as substring.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (609102469489) 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, 27686475875 + ... + 27686475896.

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

Almost surely, 2609102469481 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 55372951782.

The product of its (nonzero) digits is 746496, while the sum is 50.

The spelling of 609102469481 in words is "six hundred nine billion, one hundred two million, four hundred sixty-nine thousand, four hundred eighty-one".

Divisors: 1 11 55372951771 609102469481