Search a number
-
+
565150016001 = 3188383338667
BaseRepresentation
bin10000011100101011001…
…00001110001000000001
32000000202021110102211010
420032111210032020001
533224411401003001
61111343142111133
755554641606064
oct10162544161001
92000667412733
10565150016001
111a87514a582a
129164371b4a9
13413a783cabc
141d4d3a688db
15ea7a5718d6
hex839590e201

565150016001 has 4 divisors (see below), whose sum is σ = 753533354672. Its totient is φ = 376766677332.

The previous prime is 565150015981. The next prime is 565150016027. The reversal of 565150016001 is 100610051565.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is not a de Polignac number, because 565150016001 - 29 = 565150015489 is a prime.

It is a Duffinian number.

It is a Curzon number.

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

It is not an unprimeable number, because it can be changed into a prime (565150016071) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 94191669331 + ... + 94191669336.

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

Almost surely, 2565150016001 is an apocalyptic number.

It is an amenable number.

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

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

565150016001 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 188383338670.

The product of its (nonzero) digits is 4500, while the sum is 30.

Adding to 565150016001 its reverse (100610051565), we get a palindrome (665760067566).

The spelling of 565150016001 in words is "five hundred sixty-five billion, one hundred fifty million, sixteen thousand, one".

Divisors: 1 3 188383338667 565150016001