Search a number
-
+
320680621551 = 3313341512909
BaseRepresentation
bin1001010101010100000…
…11011111010111101111
31010122201210011110020110
410222222003133113233
520223223214342201
6403152454351103
732111523210543
oct4525203372757
91118653143213
10320680621551
11113aaa93a374
125219735b493
132431751c394
1411741999a23
15851d0706d6
hex4aaa0df5ef

320680621551 has 8 divisors (see below), whose sum is σ = 428940214960. Its totient is φ = 213104054592.

The previous prime is 320680621529. The next prime is 320680621567. The reversal of 320680621551 is 155126086023.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 320680621551 - 27 = 320680621423 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 170755516 + ... + 170757393.

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

Almost surely, 2320680621551 is an apocalyptic number.

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

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

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

The sum of its prime factors is 341513225.

The product of its (nonzero) digits is 86400, while the sum is 39.

The spelling of 320680621551 in words is "three hundred twenty billion, six hundred eighty million, six hundred twenty-one thousand, five hundred fifty-one".

Divisors: 1 3 313 939 341512909 1024538727 106893540517 320680621551