Search a number
-
+
655064150147 = 1125413753307
BaseRepresentation
bin10011000100001001101…
…11011011000010000011
32022121211112202201010122
421202010313123002003
541213032410301042
61220533214050455
765220046255631
oct11420467330203
92277745681118
10655064150147
112328a16a9600
12a6b577a9a2b
1349a06929a84
14239c33b4351
151208e0db7d2
hex9884ddb083

655064150147 has 6 divisors (see below), whose sum is σ = 720029189964. Its totient is φ = 595512863660.

The previous prime is 655064150137. The next prime is 655064150173. The reversal of 655064150147 is 741051460556.

It is a happy number.

It is not a de Polignac number, because 655064150147 - 232 = 650769182851 is a prime.

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

It is a Duffinian number.

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

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

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2706876533 + ... + 2706876774.

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

Almost surely, 2655064150147 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5413753329 (or 5413753318 counting only the distinct ones).

The product of its (nonzero) digits is 504000, while the sum is 44.

The spelling of 655064150147 in words is "six hundred fifty-five billion, sixty-four million, one hundred fifty thousand, one hundred forty-seven".

Divisors: 1 11 121 5413753307 59551286377 655064150147