Base | Representation |
---|---|
bin | 10101101110110001… |
… | …10011100101110000 |
3 | 1010010001220010122200 |
4 | 22313120303211300 |
5 | 142343131333023 |
6 | 5205401103200 |
7 | 562053020001 |
oct | 126730634560 |
9 | 33101803580 |
10 | 11666667888 |
11 | 4a47591297 |
12 | 2317187b00 |
13 | 113c0961a5 |
14 | 7c964d1a8 |
15 | 48437a743 |
hex | 2b7633970 |
11666667888 has 120 divisors (see below), whose sum is σ = 34518304080. Its totient is φ = 3668198400.
The previous prime is 11666667827. The next prime is 11666667899. The reversal of 11666667888 is 88876666611.
It is a super-2 number, since 2×116666678882 (a number of 21 digits) contains 22 as substring.
It is a plaindrome in base 10.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 628338 + ... + 646638.
It is an arithmetic number, because the mean of its divisors is an integer number (287652534).
Almost surely, 211666667888 is an apocalyptic number.
11666667888 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11666667888, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17259152040).
11666667888 is an abundant number, since it is smaller than the sum of its proper divisors (22851636192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11666667888 is a wasteful number, since it uses less digits than its factorization.
11666667888 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18567 (or 18558 counting only the distinct ones).
The product of its digits is 27869184, while the sum is 63.
The spelling of 11666667888 in words is "eleven billion, six hundred sixty-six million, six hundred sixty-seven thousand, eight hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •