Base | Representation |
---|---|
bin | 1010101100000100001110… |
… | …1100010001011110000000 |
3 | 1112121111101200001200002212 |
4 | 2223001003230101132000 |
5 | 3020021414021414331 |
6 | 40554512015401252 |
7 | 2322031430332130 |
oct | 253010354213600 |
9 | 45544350050085 |
10 | 11752166201216 |
11 | 382107a4956a1 |
12 | 1399794823228 |
13 | 6732bc35a27c |
14 | 2c8b44b6aac0 |
15 | 155a7a398d2b |
hex | ab043b11780 |
11752166201216 has 32 divisors (see below), whose sum is σ = 26757164120880. Its totient is φ = 5036642657280.
The previous prime is 11752166201177. The next prime is 11752166201221. The reversal of 11752166201216 is 61210266125711.
It is a tau number, because it is divible by the number of its divisors (32).
It is a super-2 number, since 2×117521662012162 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6558127565 + ... + 6558129356.
Almost surely, 211752166201216 is an apocalyptic number.
11752166201216 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
11752166201216 is an abundant number, since it is smaller than the sum of its proper divisors (15004997919664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11752166201216 is an equidigital number, since it uses as much as digits as its factorization.
11752166201216 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13116256942 (or 13116256930 counting only the distinct ones).
The product of its (nonzero) digits is 60480, while the sum is 41.
The spelling of 11752166201216 in words is "eleven trillion, seven hundred fifty-two billion, one hundred sixty-six million, two hundred one thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •