Search a number
-
+
105035256151 = 715005036593
BaseRepresentation
bin110000111010010010…
…1101101000101010111
3101001010002100212011021
41201310211231011113
53210103011144101
6120130314022011
710405604642410
oct1416445550527
9331102325137
10105035256151
11405aa733621
1218434117907
139b9ba63857
145125a9c807
152aeb3075a1
hex187496d157

105035256151 has 4 divisors (see below), whose sum is σ = 120040292752. Its totient is φ = 90030219552.

The previous prime is 105035256097. The next prime is 105035256181. The reversal of 105035256151 is 151652530501.

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

It is not a de Polignac number, because 105035256151 - 213 = 105035247959 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

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

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

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

Almost surely, 2105035256151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 15005036600.

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

Adding to 105035256151 its reverse (151652530501), we get a palindrome (256687786652).

The spelling of 105035256151 in words is "one hundred five billion, thirty-five million, two hundred fifty-six thousand, one hundred fifty-one".

Divisors: 1 7 15005036593 105035256151