Base | Representation |
---|---|
bin | 11000111100000010… |
… | …11110101010001000 |
3 | 1021120002000122210120 |
4 | 30132001132222020 |
5 | 204404440343323 |
6 | 10052312143240 |
7 | 652532162664 |
oct | 143601365210 |
9 | 37502018716 |
10 | 13388606088 |
11 | 5750578a10 |
12 | 2717997b20 |
13 | 1354a54130 |
14 | 9102058a4 |
15 | 5356145e3 |
hex | 31e05ea88 |
13388606088 has 512 divisors, whose sum is σ = 44351193600. Its totient is φ = 3303014400.
The previous prime is 13388606087. The next prime is 13388606111. The reversal of 13388606088 is 88060688331.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a self number, because there is not a number n which added to its sum of digits gives 13388606088.
It is not an unprimeable number, because it can be changed into a prime (13388606087) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 69370920 + ... + 69371112.
It is an arithmetic number, because the mean of its divisors is an integer number (86623425).
Almost surely, 213388606088 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 13388606088, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22175596800).
13388606088 is an abundant number, since it is smaller than the sum of its proper divisors (30962587512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13388606088 is a wasteful number, since it uses less digits than its factorization.
13388606088 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 313 (or 309 counting only the distinct ones).
The product of its (nonzero) digits is 1327104, while the sum is 51.
The spelling of 13388606088 in words is "thirteen billion, three hundred eighty-eight million, six hundred six thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •