Base | Representation |
---|---|
bin | 10101001100101111… |
… | …10101111110101001 |
3 | 1002101011202000020202 |
4 | 22212113311332221 |
5 | 141302041442412 |
6 | 5121202401545 |
7 | 552015425303 |
oct | 124627657651 |
9 | 32334660222 |
10 | 11381202857 |
11 | 4910435182 |
12 | 22576602b5 |
13 | 10c4bb717b |
14 | 79d780973 |
15 | 46928d3c2 |
hex | 2a65f5fa9 |
11381202857 has 8 divisors (see below), whose sum is σ = 12051681192. Its totient is φ = 10710835200.
The previous prime is 11381202853. The next prime is 11381202869. The reversal of 11381202857 is 75820218311.
It can be written as a sum of positive squares in 4 ways, for example, as 2550654016 + 8830548841 = 50504^2 + 93971^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11381202857 - 22 = 11381202853 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11381202857.
It is not an unprimeable number, because it can be changed into a prime (11381202851) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 285257 + ... + 322697.
It is an arithmetic number, because the mean of its divisors is an integer number (1506460149).
Almost surely, 211381202857 is an apocalyptic number.
11381202857 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
11381202857 is a deficient number, since it is larger than the sum of its proper divisors (670478335).
11381202857 is a wasteful number, since it uses less digits than its factorization.
11381202857 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55339.
The product of its (nonzero) digits is 26880, while the sum is 38.
The spelling of 11381202857 in words is "eleven billion, three hundred eighty-one million, two hundred two thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •