Search a number
-
+
101050060055 = 5724111979853
BaseRepresentation
bin101111000011100001…
…1011000110100010111
3100122211100111220211212
41132013003120310113
53123422303410210
6114231033252035
710205054224040
oct1360703306427
9318740456755
10101050060055
113994514082a
121770156401b
1396b5226459
144c686bd8c7
152966508805
hex17870d8d17

101050060055 has 16 divisors (see below), whose sum is σ = 139157984064. Its totient is φ = 69003947520.

The previous prime is 101050060003. The next prime is 101050060057. The reversal of 101050060055 is 550060050101.

It is not a de Polignac number, because 101050060055 - 212 = 101050055959 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (101050060057) 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 15 ways as a sum of consecutive naturals, for example, 5981492 + ... + 5998361.

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

Almost surely, 2101050060055 is an apocalyptic number.

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

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

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

The sum of its prime factors is 11980106.

The product of its (nonzero) digits is 750, while the sum is 23.

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

Divisors: 1 5 7 35 241 1205 1687 8435 11979853 59899265 83858971 419294855 2887144573 14435722865 20210012011 101050060055