Base | Representation |
---|---|
bin | 1010100110101110111101… |
… | …0001001111101001100000 |
3 | 1112021201221011101200221111 |
4 | 2221223233101033221200 |
5 | 3012021304203012022 |
6 | 40444441340433104 |
7 | 2312306302344610 |
oct | 251535721175140 |
9 | 45251834350844 |
10 | 11660555516512 |
11 | 3796239665321 |
12 | 1383a88548794 |
13 | 66777c930b26 |
14 | 2c4533d96a40 |
15 | 1534b790c477 |
hex | a9aef44fa60 |
11660555516512 has 48 divisors (see below), whose sum is σ = 26424999982080. Its totient is φ = 4961428541568.
The previous prime is 11660555516459. The next prime is 11660555516527. The reversal of 11660555516512 is 21561555506611.
It is a super-2 number, since 2×116605555165122 (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 (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 187220848 + ... + 187283119.
It is an arithmetic number, because the mean of its divisors is an integer number (550520832960).
Almost surely, 211660555516512 is an apocalyptic number.
It is an amenable number.
11660555516512 is an abundant number, since it is smaller than the sum of its proper divisors (14764444465568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11660555516512 is a wasteful number, since it uses less digits than its factorization.
11660555516512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 374504123 (or 374504115 counting only the distinct ones).
The product of its (nonzero) digits is 1350000, while the sum is 49.
Subtracting 11660555516512 from its reverse (21561555506611), we obtain a palindrome (9900999990099).
The spelling of 11660555516512 in words is "eleven trillion, six hundred sixty billion, five hundred fifty-five million, five hundred sixteen thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •