Search a number
-
+
71514550001 = 109656096789
BaseRepresentation
bin100001010011010011…
…0010110111011110001
320211120222020112220002
41002212212112323301
52132430211100001
652504152555345
75111124434216
oct1024646267361
9224528215802
1071514550001
112836910a994
1211a3a0b2b55
13698916249b
143665c25b0d
151cd858146b
hex10a6996ef1

71514550001 has 4 divisors (see below), whose sum is σ = 72170646900. Its totient is φ = 70858453104.

The previous prime is 71514549989. The next prime is 71514550007. The reversal of 71514550001 is 10005541517.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 59414550001 + 12100000000 = 243751^2 + 110000^2 .

It is a cyclic number.

It is not a de Polignac number, because 71514550001 - 214 = 71514533617 is a prime.

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

It is a Duffinian number.

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

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

Almost surely, 271514550001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 656096898.

The product of its (nonzero) digits is 3500, while the sum is 29.

The spelling of 71514550001 in words is "seventy-one billion, five hundred fourteen million, five hundred fifty thousand, one".

Divisors: 1 109 656096789 71514550001