Search a number
-
+
151345410335151 = 350448470111717
BaseRepresentation
bin100010011010010111011001…
…011010111110000110101111
3201211212110221212101021201120
4202122113121122332012233
5124314120400021211101
61253515042140512023
743610226233001534
oct4232273132760657
9654773855337646
10151345410335151
114425025662735a
1214b8390784b613
13665aa70894046
14295322a928d8b
151276c94ce8b36
hex89a5d96be1af

151345410335151 has 4 divisors (see below), whose sum is σ = 201793880446872. Its totient is φ = 100896940223432.

The previous prime is 151345410335137. The next prime is 151345410335153. The reversal of 151345410335151 is 151533014543151.

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 151345410335151 - 27 = 151345410335023 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2151345410335151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 50448470111720.

The product of its (nonzero) digits is 270000, while the sum is 42.

The spelling of 151345410335151 in words is "one hundred fifty-one trillion, three hundred forty-five billion, four hundred ten million, three hundred thirty-five thousand, one hundred fifty-one".

Divisors: 1 3 50448470111717 151345410335151