Search a number
-
+
5020314486957 = 3572111095932
BaseRepresentation
bin100100100001110001000…
…0011111100100010101101
3122202221022100101222200000
41021003202003330202231
51124223101002040312
614402144534254513
71025464034023500
oct111034203744255
918687270358600
105020314486957
111666115715260
12690b791b7439
132a554b96c953
14134dad733137
158a8cadadadc
hex490e20fc8ad

5020314486957 has 216 divisors, whose sum is σ = 9647005848480. Its totient is φ = 2579671825920.

The previous prime is 5020314486919. The next prime is 5020314486961. The reversal of 5020314486957 is 7596844130205.

It is a happy number.

5020314486957 is a `hidden beast` number, since 50 + 20 + 3 + 1 + 4 + 486 + 95 + 7 = 666.

It is not a de Polignac number, because 5020314486957 - 26 = 5020314486893 is a prime.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (5020314486917) 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 215 ways as a sum of consecutive naturals, for example, 8465960053 + ... + 8465960645.

It is a 1-persistent number, because it is pandigital, but 2⋅5020314486957 = 10040628973914 is not.

Almost surely, 25020314486957 is an apocalyptic number.

It is an amenable number.

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

5020314486957 is an equidigital number, since it uses as much as digits as its factorization.

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

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

The product of its (nonzero) digits is 7257600, while the sum is 54.

The spelling of 5020314486957 in words is "five trillion, twenty billion, three hundred fourteen million, four hundred eighty-six thousand, nine hundred fifty-seven".