Base | Representation |
---|---|
bin | 10101110000000101… |
… | …10001110010010110 |
3 | 1010010211121010110200 |
4 | 22320002301302112 |
5 | 142403440424200 |
6 | 5210433001330 |
7 | 562245363510 |
oct | 127002616226 |
9 | 33124533420 |
10 | 11677670550 |
11 | 4a528167a7 |
12 | 231a9b3246 |
13 | 1141449240 |
14 | 7cacb4bb0 |
15 | 485300800 |
hex | 2b80b1c96 |
11677670550 has 288 divisors, whose sum is σ = 39864115200. Its totient is φ = 2384121600.
The previous prime is 11677670531. The next prime is 11677670551. The reversal of 11677670550 is 5507677611.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a junction number, because it is equal to n+sod(n) for n = 11677670496 and 11677670505.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11677670551) by changing a digit.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 1264851 + ... + 1274049.
Almost surely, 211677670550 is an apocalyptic number.
11677670550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 11677670550, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19932057600).
11677670550 is an abundant number, since it is smaller than the sum of its proper divisors (28186444650).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11677670550 is a wasteful number, since it uses less digits than its factorization.
11677670550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9268 (or 9260 counting only the distinct ones).
The product of its (nonzero) digits is 308700, while the sum is 45.
The spelling of 11677670550 in words is "eleven billion, six hundred seventy-seven million, six hundred seventy thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •