Search a number
-
+
30367453530169 = 740910606864663
BaseRepresentation
bin1101110011110011110010…
…10001111100100000111001
310222112002201001100011012101
412321321321101330200321
512440020021100431134
6144330340543343401
76252655544020120
oct671717121744071
9128462631304171
1030367453530169
1197488459269a8
1234a54ba8b1b61
1313c383bc65702
1476db14c38ab7
15379dd923de14
hex1b9e7947c839

30367453530169 has 8 divisors (see below), whose sum is σ = 34790516097920. Its totient is φ = 25965604692576.

The previous prime is 30367453530061. The next prime is 30367453530191. The reversal of 30367453530169 is 96103535476303.

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 30367453530169 - 27 = 30367453530041 is a prime.

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

It is a Duffinian number.

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

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

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

Almost surely, 230367453530169 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 10606865079.

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

The spelling of 30367453530169 in words is "thirty trillion, three hundred sixty-seven billion, four hundred fifty-three million, five hundred thirty thousand, one hundred sixty-nine".

Divisors: 1 7 409 2863 10606864663 74248052641 4338207647167 30367453530169