Search a number
-
+
30921459693 = 3192231241377
BaseRepresentation
bin11100110011000100…
…000000011111101101
32221210222011220102220
4130303010000133231
51001311343202233
622112150105553
72143156033155
oct346304003755
987728156386
1030921459693
11121283a3373
125bab64b2b9
132bba263417
1416d498d765
15c0e993eb3
hex7331007ed

30921459693 has 24 divisors (see below), whose sum is σ = 45404641728. Its totient is φ = 18680226048.

The previous prime is 30921459691. The next prime is 30921459697. The reversal of 30921459693 is 39695412903.

It is not a de Polignac number, because 30921459693 - 21 = 30921459691 is a prime.

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

It is a congruent number.

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

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

Almost surely, 230921459693 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1241441 (or 1241422 counting only the distinct ones).

The product of its (nonzero) digits is 1574640, while the sum is 51.

The spelling of 30921459693 in words is "thirty billion, nine hundred twenty-one million, four hundred fifty-nine thousand, six hundred ninety-three".

Divisors: 1 3 19 23 57 69 361 437 1083 1311 8303 24909 1241377 3724131 23586163 28551671 70758489 85655013 448137097 542481749 1344411291 1627445247 10307153231 30921459693