Search a number
-
+
30160506423 = 310219846721
BaseRepresentation
bin11100000101101101…
…001100111000110111
32212211221022110210110
4130011231030320313
5443232042201143
621504444154103
72115256034415
oct340555147067
985757273713
1030160506423
1111877901973
125a18838933
132ac8702208
1416618aa2b5
15bb7c81533
hex705b4ce37

30160506423 has 8 divisors (see below), whose sum is σ = 40253399536. Its totient is φ = 20087308800.

The previous prime is 30160506419. The next prime is 30160506437. The reversal of 30160506423 is 32460506103.

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

It is not a de Polignac number, because 30160506423 - 22 = 30160506419 is a prime.

It is a super-2 number, since 2×301605064232 (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 (30160506443) 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, 4920298 + ... + 4926423.

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

Almost surely, 230160506423 is an apocalyptic number.

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

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

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

The sum of its prime factors is 9847745.

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

The spelling of 30160506423 in words is "thirty billion, one hundred sixty million, five hundred six thousand, four hundred twenty-three".

Divisors: 1 3 1021 3063 9846721 29540163 10053502141 30160506423