Search a number
-
+
101535305245 = 5111846096459
BaseRepresentation
bin101111010001111111…
…0011100111000011101
3100201002011120221002221
41132203332130320131
53130421014231440
6114351125545341
710223065566043
oct1364376347035
9321064527087
10101535305245
113a07403a710
1217817b75251
13976191369a
144cb2d14393
152993e09d4a
hex17a3f9ce1d

101535305245 has 8 divisors (see below), whose sum is σ = 132918945120. Its totient is φ = 73843858320.

The previous prime is 101535305231. The next prime is 101535305251. The reversal of 101535305245 is 542503535101.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 101535305245 - 25 = 101535305213 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 101535305245.

It is a congruent number.

It is an unprimeable number.

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

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

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

Almost surely, 2101535305245 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1846096475.

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

The spelling of 101535305245 in words is "one hundred one billion, five hundred thirty-five million, three hundred five thousand, two hundred forty-five".

Divisors: 1 5 11 55 1846096459 9230482295 20307061049 101535305245