Search a number
-
+
5212987634592 = 253479131919301
BaseRepresentation
bin100101111011011111001…
…0001101011001110100000
3200110100122001221000020000
41023312332101223032200
51140402144313301332
615030451412420000
71045424456533053
oct113667621531640
920410561830200
105212987634592
11172a8a7687871
1270238b017600
132ba776045a0a
1414044a6d4a9a
1590905ea3b7c
hex4bdbe46b3a0

5212987634592 has 240 divisors, whose sum is σ = 15537893817600. Its totient is φ = 1714277260800.

The previous prime is 5212987634573. The next prime is 5212987634627. The reversal of 5212987634592 is 2954367892125.

5212987634592 is a `hidden beast` number, since 5 + 2 + 1 + 2 + 9 + 8 + 7 + 6 + 34 + 592 = 666.

It is an unprimeable number.

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 39 ways as a sum of consecutive naturals, for example, 270079342 + ... + 270098642.

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

Almost surely, 25212987634592 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 5212987634592, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7768946908800).

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

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

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

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

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

The product of its digits is 65318400, while the sum is 63.

The spelling of 5212987634592 in words is "five trillion, two hundred twelve billion, nine hundred eighty-seven million, six hundred thirty-four thousand, five hundred ninety-two".