Search a number
-
+
105032156358 = 23122663142711
BaseRepresentation
bin110000111010001100…
…1111000010011000110
3101001002212112101001010
41201310121320103012
53210101213000413
6120130123343050
710405536412203
oct1416431702306
9331085471033
10105032156358
11405a8a06708
1218433081a86
139b9b21995c
1451254d2caa
152aeade3dc3
hex18746784c6

105032156358 has 16 divisors (see below), whose sum is σ = 210067497216. Its totient is φ = 35010188040.

The previous prime is 105032156323. The next prime is 105032156381. The reversal of 105032156358 is 853651230501.

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 664623 + ... + 807333.

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

Almost surely, 2105032156358 is an apocalyptic number.

105032156358 is an abundant number, since it is smaller than the sum of its proper divisors (105035340858).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 265379.

The product of its (nonzero) digits is 108000, while the sum is 39.

Adding to 105032156358 its reverse (853651230501), we get a palindrome (958683386859).

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

Divisors: 1 2 3 6 122663 142711 245326 285422 367989 428133 735978 856266 17505359393 35010718786 52516078179 105032156358