Base | Representation |
---|---|
bin | 10101100001101101… |
… | …10000111111001110 |
3 | 1002211102200112202110 |
4 | 22300312300333032 |
5 | 142132103043123 |
6 | 5150444204450 |
7 | 556252365546 |
oct | 126066607716 |
9 | 32742615673 |
10 | 11557081038 |
11 | 49a0742048 |
12 | 22a6539726 |
13 | 1122476bb9 |
14 | 7b8c84326 |
15 | 479930493 |
hex | 2b0db0fce |
11557081038 has 8 divisors (see below), whose sum is σ = 23114162088. Its totient is φ = 3852360344.
The previous prime is 11557081031. The next prime is 11557081069. The reversal of 11557081038 is 83018075511.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
11557081038 is an admirable number.
It is a super-2 number, since 2×115570810382 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11557080987 and 11557081005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11557081031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 963090081 + ... + 963090092.
It is an arithmetic number, because the mean of its divisors is an integer number (2889270261).
Almost surely, 211557081038 is an apocalyptic number.
11557081038 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11557081038 is a wasteful number, since it uses less digits than its factorization.
11557081038 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1926180178.
The product of its (nonzero) digits is 33600, while the sum is 39.
The spelling of 11557081038 in words is "eleven billion, five hundred fifty-seven million, eighty-one thousand, thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •