Search a number
-
+
50451451001 = 725917451211
BaseRepresentation
bin101110111111001001…
…000000110001111001
311211020001022020222022
4232333021000301321
51311311032413001
635102125404225
73434143154300
oct567711006171
9154201266868
1050451451001
111a43a58a956
129940109675
1349b0456cb3
142628689437
1514a431d11b
hexbbf240c79

50451451001 has 12 divisors (see below), whose sum is σ = 59683145040. Its totient is φ = 42511147560.

The previous prime is 50451450989. The next prime is 50451451019. The reversal of 50451451001 is 10015415405.

It is not a de Polignac number, because 50451451001 - 218 = 50451188857 is a prime.

It is a Duffinian number.

It is a Curzon number.

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

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

Almost surely, 250451451001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 2000, while the sum is 26.

Adding to 50451451001 its reverse (10015415405), we get a palindrome (60466866406).

The spelling of 50451451001 in words is "fifty billion, four hundred fifty-one million, four hundred fifty-one thousand, one".

Divisors: 1 7 49 59 413 2891 17451211 122158477 855109339 1029621449 7207350143 50451451001