Search a number
-
+
30925995265 = 511562290823
BaseRepresentation
bin11100110011010101…
…010011110100000001
32221211021201100002001
4130303111103310001
51001314023322030
622112431224001
72143242423334
oct346325236401
987737640061
1030925995265
111212aa10a80
125bb1078001
132bbb1909a9
1416d541061b
15c1008ccca
hex733553d01

30925995265 has 8 divisors (see below), whose sum is σ = 40484939328. Its totient is φ = 22491632880.

The previous prime is 30925995263. The next prime is 30925995271. The reversal of 30925995265 is 56259952903.

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

It is not a de Polignac number, because 30925995265 - 21 = 30925995263 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (55), and also a Moran number because the ratio is a prime number: 562290823 = 30925995265 / (3 + 0 + 9 + 2 + 5 + 9 + 9 + 5 + 2 + 6 + 5).

It is a Duffinian number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 281145357 + ... + 281145466.

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

Almost surely, 230925995265 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 562290839.

The product of its (nonzero) digits is 6561000, while the sum is 55.

The spelling of 30925995265 in words is "thirty billion, nine hundred twenty-five million, nine hundred ninety-five thousand, two hundred sixty-five".

Divisors: 1 5 11 55 562290823 2811454115 6185199053 30925995265