Search a number
-
+
155656061101 = 1075472659469
BaseRepresentation
bin1001000011110111010…
…0110000000010101101
3112212202221100012002001
42100331310300002231
510022240422423401
6155301333332301
714150205455212
oct2207564600255
9485687305061
10155656061101
1160016874612
1226200a97091
13118a8304a88
147768a2db09
1540b0429601
hex243dd300ad

155656061101 has 8 divisors (see below), whose sum is σ = 157398072480. Its totient is φ = 153919369968.

The previous prime is 155656061081. The next prime is 155656061191. The reversal of 155656061101 is 101160656551.

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

It is a cyclic number.

It is not a de Polignac number, because 155656061101 - 229 = 155119190189 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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, 1271206 + ... + 1388263.

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

Almost surely, 2155656061101 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2660123.

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

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

Divisors: 1 107 547 58529 2659469 284563183 1454729543 155656061101