Search a number
-
+
105005061060561 = 3254323214775123
BaseRepresentation
bin10111111000000001100101…
…010111010011011111010001
3111202210101102020201011121100
4113320001211113103133101
5102230400331112414221
61011154354211215013
731055236205204124
oct2770014527233721
9452711366634540
10105005061060561
113050443a546412
12b93a8265a7469
134678c1c8c76ac
141bd03b47d23bb
15c216514a9926
hex5f80655d37d1

105005061060561 has 12 divisors (see below), whose sum is σ = 151676769870288. Its totient is φ = 70002085063704.

The previous prime is 105005061060547. The next prime is 105005061060671. The reversal of 105005061060561 is 165060160500501.

It is not a de Polignac number, because 105005061060561 - 27 = 105005061060433 is a prime.

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

It is a Curzon number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 106898655 + ... + 107876468.

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

Almost surely, 2105005061060561 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 214829452 (or 214829449 counting only the distinct ones).

The product of its (nonzero) digits is 27000, while the sum is 36.

The spelling of 105005061060561 in words is "one hundred five trillion, five billion, sixty-one million, sixty thousand, five hundred sixty-one".

Divisors: 1 3 9 54323 162969 488907 214775123 644325369 1932976107 11667229006729 35001687020187 105005061060561