Search a number
-
+
11667996485152 = 257531739947
BaseRepresentation
bin1010100111001010101011…
…0010010010011000100000
31112022110010201220001222121
42221302222302102120200
53012132024100011102
640452111550314024
72312661554500000
oct251625262223040
945273121801877
1011667996485152
113799407917187
1213854044b8914
136683973c0a57
142c4a3c300000
151537a0ccdb37
hexa9caac92620

11667996485152 has 288 divisors, whose sum is σ = 27730894786560. Its totient is φ = 4827609642240.

The previous prime is 11667996485147. The next prime is 11667996485177. The reversal of 11667996485152 is 25158469976611.

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

It is an unprimeable number.

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 12321009543 + ... + 12321010489.

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

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

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

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

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

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

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

The product of its digits is 195955200, while the sum is 70.

The spelling of 11667996485152 in words is "eleven trillion, six hundred sixty-seven billion, nine hundred ninety-six million, four hundred eighty-five thousand, one hundred fifty-two".