Search a number
-
+
512140104667040 = 255231316353167221
BaseRepresentation
bin111010001110010011110100…
…1000000111000111110100000
32111011100010010110022021011012
41310130213221000320332200
51014111400413243321130
65013121525513040052
7212605621136130263
oct16434475100707640
92434303113267135
10512140104667040
1113920244268a6a3
12495342249b6028
1318c9c7b2531405
1490679db510cda
153e31e15817995
hex1d1c9e9038fa0

512140104667040 has 192 divisors, whose sum is σ = 1272382234244352. Its totient is φ = 194421690777600.

The previous prime is 512140104667021. The next prime is 512140104667117. The reversal of 512140104667040 is 40766401041215.

It is an unprimeable number.

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 31 ways as a sum of consecutive naturals, for example, 3062570630 + ... + 3062737850.

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

Almost surely, 2512140104667040 is an apocalyptic number.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 512140104667040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (636191117122176).

512140104667040 is an abundant number, since it is smaller than the sum of its proper divisors (760242129577312).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 161280, while the sum is 41.

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