Search a number
-
+
56010050151 = 31155711292699
BaseRepresentation
bin110100001010011101…
…011000101001100111
312100120102210100111220
4310022131120221213
51404202033101101
641421453431423
74021660366566
oct641235305147
9170512710456
1056010050151
1121832238750
12aa3179b573
135387c47113
1429d49d7bdd
1516cc315636
hexd0a758a67

56010050151 has 32 divisors (see below), whose sum is σ = 81717984000. Its totient is φ = 33841985280.

The previous prime is 56010050113. The next prime is 56010050167. The reversal of 56010050151 is 15105001065.

56010050151 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 56010050151 - 27 = 56010050023 is a prime.

It is a congruent number.

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 20750800 + ... + 20753498.

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

Almost surely, 256010050151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 4399.

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

The spelling of 56010050151 in words is "fifty-six billion, ten million, fifty thousand, one hundred fifty-one".

Divisors: 1 3 11 33 557 1129 1671 2699 3387 6127 8097 12419 18381 29689 37257 89067 628853 1503343 1886559 3047171 4510029 6917383 9141513 16536773 20752149 33518881 49610319 100556643 1697274247 5091822741 18670016717 56010050151