Search a number
-
+
514256716107750 = 235371159150930139
BaseRepresentation
bin111010011101101101011100…
…0111000110000111111100110
32111102211110110202011002010210
41310323122320320300333212
51014401040223310422000
65021422135102000250
7213214551553413210
oct16473327070607746
92442743422132123
10514256716107750
11139949059663880
1249816491876086
13190c427ac31575
1490dc22d2775b0
153e6bee6053350
hex1d3b6b8e30fe6

514256716107750 has 256 divisors, whose sum is σ = 1627437439180800. Its totient is φ = 105047376048000.

The previous prime is 514256716107731. The next prime is 514256716107763. The reversal of 514256716107750 is 57701617652415.

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 72057820 + ... + 78872319.

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

Almost surely, 2514256716107750 is an apocalyptic number.

514256716107750 is a gapful number since it is divisible by the number (50) formed by its first and last digit.

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

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

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

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

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

The product of its (nonzero) digits is 12348000, while the sum is 57.

The spelling of 514256716107750 in words is "five hundred fourteen trillion, two hundred fifty-six billion, seven hundred sixteen million, one hundred seven thousand, seven hundred fifty".