Search a number
-
+
25067040481 = 717210647399
BaseRepresentation
bin10111010110000111…
…001010111011100001
32101200222001121001201
4113112013022323201
5402314130243411
615303213401201
71545120220450
oct272607127341
971628047051
1025067040481
11a6a376658a
124a36a99201
1324963a9c42
1412db238b97
159baa163c1
hex5d61caee1

25067040481 has 8 divisors (see below), whose sum is σ = 30333225600. Its totient is φ = 20222150208.

The previous prime is 25067040443. The next prime is 25067040517. The reversal of 25067040481 is 18404076052.

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 25067040481 - 27 = 25067040353 is a prime.

It is a super-2 number, since 2×250670404812 (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 25067040481.

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

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

Almost surely, 225067040481 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 210647423.

The product of its (nonzero) digits is 53760, while the sum is 37.

The spelling of 25067040481 in words is "twenty-five billion, sixty-seven million, forty thousand, four hundred eighty-one".

Divisors: 1 7 17 119 210647399 1474531793 3581005783 25067040481