Search a number
-
+
351106630330153 = 1312680203284963
BaseRepresentation
bin100111111010101000110000…
…1111110101010011100101001
31201001011110120202022021211011
41033311101201332222130221
5332010012334331031103
63242424054222103521
7133645421415625315
oct11765214176523451
91631143522267734
10351106630330153
11a19675385437a5
123346699811aba1
13120bb2a0456a29
14629b919d16b45
152a8d1510b6d6d
hex13f5461faa729

351106630330153 has 4 divisors (see below), whose sum is σ = 353786833615248. Its totient is φ = 348426427045060.

The previous prime is 351106630330139. The next prime is 351106630330187. The reversal of 351106630330153 is 351033036601153.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 351106630330153 - 229 = 351106093459241 is a prime.

It is a Duffinian number.

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

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

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

Almost surely, 2351106630330153 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2680203285094.

The product of its (nonzero) digits is 218700, while the sum is 40.

The spelling of 351106630330153 in words is "three hundred fifty-one trillion, one hundred six billion, six hundred thirty million, three hundred thirty thousand, one hundred fifty-three".

Divisors: 1 131 2680203284963 351106630330153