Search a number
-
+
51006010611052 = 227177313776913933
BaseRepresentation
bin10111001100011110000110…
…01001001101010101101100
320200121010102120121100221001
423212033003021031111230
523141140302204023202
6300251500544050044
713513030330501420
oct1346170311152554
9220533376540831
1051006010611052
11152855892a2032
125879381903924
13225cb000312b3
14c849c0022b80
155d6bb3e07d87
hex2e63c324d56c

51006010611052 has 192 divisors, whose sum is σ = 110442917249280. Its totient is φ = 20116263665664.

The previous prime is 51006010611007. The next prime is 51006010611053. The reversal of 51006010611052 is 25011601060015.

It is a happy number.

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

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

It is a Harshad number since it is a multiple of its sum of digits (28).

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

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3660799078 + ... + 3660813010.

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

Almost surely, 251006010611052 is an apocalyptic number.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 51006010611052, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (55221458624640).

51006010611052 is an abundant number, since it is smaller than the sum of its proper divisors (59436906638228).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 14940 (or 14938 counting only the distinct ones).

The product of its (nonzero) digits is 1800, while the sum is 28.

Adding to 51006010611052 its reverse (25011601060015), we get a palindrome (76017611671067).

The spelling of 51006010611052 in words is "fifty-one trillion, six billion, ten million, six hundred eleven thousand, fifty-two".