Search a number
-
+
30479135567 = 1311028922613
BaseRepresentation
bin11100011000101100…
…101011001101001111
32220200010212111210212
4130120230223031033
5444410124314232
622000225353035
72126205243356
oct343054531517
986603774725
1030479135567
1111a2074a741
125aa749877b
132b4972347a
141691d2c99d
15bd5c1eeb2
hex718b2b34f

30479135567 has 8 divisors (see below), whose sum is σ = 30716143920. Its totient is φ = 30242193280.

The previous prime is 30479135563. The next prime is 30479135581. The reversal of 30479135567 is 76553197403.

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 30479135567 - 22 = 30479135563 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 230479135567 is an apocalyptic number.

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

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

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

The sum of its prime factors is 33033.

The product of its (nonzero) digits is 2381400, while the sum is 50.

The spelling of 30479135567 in words is "thirty billion, four hundred seventy-nine million, one hundred thirty-five thousand, five hundred sixty-seven".

Divisors: 1 131 10289 22613 1347859 2962303 232665157 30479135567