Search a number
-
+
155511666051 = 3719389753549
BaseRepresentation
bin1001000011010100110…
…1111011010110000011
3112212101212122011022020
42100311031323112003
510021441441303201
6155235134412523
714143503231330
oct2206515732603
9485355564266
10155511666051
115aa52310465
1226180661143
1311884419111
1477537a3987
1540a2905a36
hex243537b583

155511666051 has 16 divisors (see below), whose sum is σ = 249442272000. Its totient is φ = 84186766368.

The previous prime is 155511666031. The next prime is 155511666077. The reversal of 155511666051 is 150666115551.

155511666051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is not a de Polignac number, because 155511666051 - 26 = 155511665987 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 155511665994 and 155511666012.

It is not an unprimeable number, because it can be changed into a prime (155511666031) 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, 194876376 + ... + 194877173.

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

Almost surely, 2155511666051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 389753578.

The product of its (nonzero) digits is 135000, while the sum is 42.

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

Divisors: 1 3 7 19 21 57 133 399 389753549 1169260647 2728274843 7405317431 8184824529 22215952293 51837222017 155511666051