Search a number
-
+
51001506001 = 312516554621
BaseRepresentation
bin101111011111111011…
…010011100011010001
311212122101022221120201
4233133323103203101
51313422341143001
635232455135201
73453602435215
oct573773234321
9155571287521
1051001506001
111a6a2025366
129a74374501
134a6a3b6524
14267b750945
1514d7772501
hexbdfed38d1

51001506001 has 8 divisors (see below), whose sum is σ = 52856471808. Its totient is φ = 49159650000.

The previous prime is 51001505977. The next prime is 51001506019. The reversal of 51001506001 is 10060510015.

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

It is a cyclic number.

It is not a de Polignac number, because 51001506001 - 221 = 50999408849 is a prime.

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

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 51001506001.

It is not an unprimeable number, because it can be changed into a prime (51001506301) 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, 3269530 + ... + 3285091.

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

Almost surely, 251001506001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 6554903.

The product of its (nonzero) digits is 150, while the sum is 19.

The spelling of 51001506001 in words is "fifty-one billion, one million, five hundred six thousand, one".

Divisors: 1 31 251 7781 6554621 203193251 1645209871 51001506001