Search a number
-
+
320100215133 = 3193155256381
BaseRepresentation
bin1001010100001110111…
…01011010100101011101
31010121020100000202022110
410222013131122211131
520221031123341013
6403015122304233
732061244635546
oct4520735324535
91117210022273
10320100215133
11113832254446
1252054ab8079
13242541c3c2a
14116c88734cd
1584d71232c3
hex4a8775a95d

320100215133 has 8 divisors (see below), whose sum is σ = 427021320096. Its totient is φ = 213289626800.

The previous prime is 320100215131. The next prime is 320100215189. The reversal of 320100215133 is 331512001023.

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 320100215133 - 21 = 320100215131 is a prime.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (320100215131) 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, 27622398 + ... + 27633983.

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

Almost surely, 2320100215133 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 55258315.

The product of its (nonzero) digits is 540, while the sum is 21.

Adding to 320100215133 its reverse (331512001023), we get a palindrome (651612216156).

The spelling of 320100215133 in words is "three hundred twenty billion, one hundred million, two hundred fifteen thousand, one hundred thirty-three".

Divisors: 1 3 1931 5793 55256381 165769143 106700071711 320100215133