Search a number
-
+
30536505630515 = 56107301126103
BaseRepresentation
bin1101111000101110101011…
…00100100001111100110011
311000010021001120200122110002
412330113111210201330303
513000302230420134030
6144540135500500215
76301122035120333
oct674272544417463
9130107046618402
1030536505630515
119803506386025
123512219b4a66b
1314067706c4a11
14777d90a470c3
1537e4d074a245
hex1bc5d5921f33

30536505630515 has 4 divisors (see below), whose sum is σ = 36643806756624. Its totient is φ = 24429204504408.

The previous prime is 30536505630467. The next prime is 30536505630611. The reversal of 30536505630515 is 51503650563503.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 30536505630515 - 230 = 30535431888691 is a prime.

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

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 30536505630515.

It is an unprimeable number.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3053650563047 + ... + 3053650563056.

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

Almost surely, 230536505630515 is an apocalyptic number.

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

30536505630515 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 6107301126108.

The product of its (nonzero) digits is 3037500, while the sum is 47.

The spelling of 30536505630515 in words is "thirty trillion, five hundred thirty-six billion, five hundred five million, six hundred thirty thousand, five hundred fifteen".

Divisors: 1 5 6107301126103 30536505630515