Search a number
-
+
156211066015 = 531242213203
BaseRepresentation
bin1001000101111011100…
…1111011010010011111
3112221012121200100200121
42101132321323102133
510024410013103030
6155432401135411
714200025103304
oct2213671732237
9487177610617
10156211066015
116028108aa64
122633692a567
13119662a8354
1477bc6230ab
1540e400a47a
hex245ee7b49f

156211066015 has 4 divisors (see below), whose sum is σ = 187453279224. Its totient is φ = 124968852808.

The previous prime is 156211066001. The next prime is 156211066019. The reversal of 156211066015 is 510660112651.

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-156211066015 is a prime.

It is a Duffinian number.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 2156211066015 is an apocalyptic number.

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

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

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

The sum of its prime factors is 31242213208.

The product of its (nonzero) digits is 10800, while the sum is 34.

Adding to 156211066015 its reverse (510660112651), we get a palindrome (666871178666).

The spelling of 156211066015 in words is "one hundred fifty-six billion, two hundred eleven million, sixty-six thousand, fifteen".

Divisors: 1 5 31242213203 156211066015