Base | Representation |
---|---|
bin | 10101101011011111… |
… | …11001111101000110 |
3 | 1010001011011001001100 |
4 | 22311233321331012 |
5 | 142314111400323 |
6 | 5202535440530 |
7 | 561300205563 |
oct | 126557717506 |
9 | 33034131040 |
10 | 11639168838 |
11 | 4a33009900 |
12 | 2309b26146 |
13 | 113648866b |
14 | 7c5b3186a |
15 | 481c47943 |
hex | 2b5bf9f46 |
11639168838 has 72 divisors (see below), whose sum is σ = 27795431664. Its totient is φ = 3517319520.
The previous prime is 11639168833. The next prime is 11639168851. The reversal of 11639168838 is 83886193611.
11639168838 is a `hidden beast` number, since 116 + 391 + 68 + 83 + 8 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11639168831) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 805231 + ... + 819557.
It is an arithmetic number, because the mean of its divisors is an integer number (386047662).
Almost surely, 211639168838 is an apocalyptic number.
11639168838 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 11639168838, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13897715832).
11639168838 is an abundant number, since it is smaller than the sum of its proper divisors (16156262826).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11639168838 is a wasteful number, since it uses less digits than its factorization.
11639168838 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14730 (or 14716 counting only the distinct ones).
The product of its digits is 1492992, while the sum is 54.
The spelling of 11639168838 in words is "eleven billion, six hundred thirty-nine million, one hundred sixty-eight thousand, eight hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •