Search a number
-
+
153036473223071 = 288313530799767
BaseRepresentation
bin100010110010111110010100…
…100111111100011110011111
3202001212010212221112202221102
4202302332110213330132133
5130024322144121114241
61301251552451223315
744143343320246004
oct4262762447743637
9661763787482842
10153036473223071
11448424495332a9
12151b75b12a7b3b
13675137b897ac9
1429b100d3518ab
1512a5c6ac0e39b
hex8b2f949fc79f

153036473223071 has 4 divisors (see below), whose sum is σ = 153037004311152. Its totient is φ = 153035942134992.

The previous prime is 153036473223047. The next prime is 153036473223079. The reversal of 153036473223071 is 170322374630351.

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 153036473223071 - 218 = 153036472960927 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 (153036473223079) by changing a digit.

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

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

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

Almost surely, 2153036473223071 is an apocalyptic number.

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

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

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

The sum of its prime factors is 531088080.

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

The spelling of 153036473223071 in words is "one hundred fifty-three trillion, thirty-six billion, four hundred seventy-three million, two hundred twenty-three thousand, seventy-one".

Divisors: 1 288313 530799767 153036473223071