Search a number
-
+
2126513106432 = 2932111323193727
BaseRepresentation
bin11110111100011110000…
…011101110111000000000
321112021220100120112211200
4132330132003232320000
5234320044323401212
64304523455541200
7306430656110661
oct36743603567000
97467810515750
102126513106432
1174a9382351a0
122a4170b2a800
131256b5c0b070
1474cd0c0d368
153a4aeb726dc
hex1ef1e0eee00

2126513106432 has 960 divisors, whose sum is σ = 7573081291776. Its totient is φ = 565240135680.

The previous prime is 2126513106427. The next prime is 2126513106479. The reversal of 2126513106432 is 2346013156212.

2126513106432 is a `hidden beast` number, since 2 + 1 + 2 + 6 + 5 + 1 + 3 + 1 + 0 + 643 + 2 = 666.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 2925052053 + ... + 2925052779.

Almost surely, 22126513106432 is an apocalyptic number.

2126513106432 is a gapful number since it is divisible by the number (22) formed by its first and last digit.

It is an amenable number.

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

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

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

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

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

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

The product of its (nonzero) digits is 51840, while the sum is 36.

The spelling of 2126513106432 in words is "two trillion, one hundred twenty-six billion, five hundred thirteen million, one hundred six thousand, four hundred thirty-two".