Search a number
-
+
6894692955072 = 263413791093
BaseRepresentation
bin110010001010100101110…
…1110010111001111000000
3220102010102000011211010000
41210111023232113033000
51400430312344030242
622355213410040000
71311060630103416
oct144251356271700
926363360154100
106894692955072
1122190284798aa
129342a2879000
133b0222493a20
1419b9c24292b6
15be53060ba4c
hex6454bb973c0

6894692955072 has 560 divisors, whose sum is σ = 22495173500800. Its totient is φ = 2075373840384.

The previous prime is 6894692955037. The next prime is 6894692955089. The reversal of 6894692955072 is 2705592964986.

6894692955072 is a `hidden beast` number, since 6 + 8 + 9 + 4 + 69 + 2 + 9 + 550 + 7 + 2 = 666.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 63254063754 + ... + 63254063862.

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

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

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

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

6894692955072 is an frugal number, since it uses more digits than its factorization.

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

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

The product of its (nonzero) digits is 587865600, while the sum is 72.

The spelling of 6894692955072 in words is "six trillion, eight hundred ninety-four billion, six hundred ninety-two million, nine hundred fifty-five thousand, seventy-two".