Search a number
-
+
151061655551 = 4325713669501
BaseRepresentation
bin1000110010101111111…
…0011110111111111111
3112102220202011012111112
42030223332132333333
54433333240434201
6153221411312235
713625306612642
oct2145376367777
9472822135445
10151061655551
1159079403734
122533a2ab67b
13113254c6001
14745078ba59
153de1dde0bb
hex232bf9efff

151061655551 has 8 divisors (see below), whose sum is σ = 155176186704. Its totient is φ = 146974464000.

The previous prime is 151061655523. The next prime is 151061655571. The reversal of 151061655551 is 155556160151.

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-151061655551 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 2151061655551 is an apocalyptic number.

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

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

151061655551 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 13669801.

The product of its (nonzero) digits is 112500, while the sum is 41.

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

Divisors: 1 43 257 11051 13669501 587788543 3513061757 151061655551