Search a number
-
+
59955907681 = 391115330071
BaseRepresentation
bin110111110101101001…
…101000110001100001
312201202102121200110101
4313311221220301201
51440242203021211
643313211102401
74221522543445
oct676551506141
9181672550411
1059955907681
112347760192a
12b753141a01
13586658ca67
142c8aa96825
15185d9435c1
hexdf5a68c61

59955907681 has 4 divisors (see below), whose sum is σ = 59971241664. Its totient is φ = 59940573700.

The previous prime is 59955907679. The next prime is 59955907699. The reversal of 59955907681 is 18670955995.

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 a cyclic number.

It is not a de Polignac number, because 59955907681 - 21 = 59955907679 is a prime.

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

It is a Duffinian number.

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

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

Almost surely, 259955907681 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 15333982.

The product of its (nonzero) digits is 30618000, while the sum is 64.

The spelling of 59955907681 in words is "fifty-nine billion, nine hundred fifty-five million, nine hundred seven thousand, six hundred eighty-one".

Divisors: 1 3911 15330071 59955907681