Base | Representation |
---|---|
bin | 10100011111010100… |
… | …00001100010110100 |
3 | 1001101121121121121101 |
4 | 22033222001202310 |
5 | 140012010432402 |
6 | 5015310055444 |
7 | 536410150360 |
oct | 121752014264 |
9 | 31347547541 |
10 | 11000092852 |
11 | 47352a1631 |
12 | 216baaa584 |
13 | 1063c5a9a8 |
14 | 764cd62a0 |
15 | 445aabb87 |
hex | 28fa818b4 |
11000092852 has 12 divisors (see below), whose sum is σ = 22000185760. Its totient is φ = 4714325496.
The previous prime is 11000092849. The next prime is 11000092871. The reversal of 11000092852 is 25829000011.
11000092852 is an admirable number.
It is a Harshad number since it is a multiple of its sum of digits (28), and also a Moran number because the ratio is a prime number: 392860459 = 11000092852 / (1 + 1 + 0 + 0 + 0 + 0 + 9 + 2 + 8 + 5 + 2).
It is a self number, because there is not a number n which added to its sum of digits gives 11000092852.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 196430202 + ... + 196430257.
Almost surely, 211000092852 is an apocalyptic number.
It is an amenable number.
11000092852 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.
11000092852 is a wasteful number, since it uses less digits than its factorization.
11000092852 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 392860470 (or 392860468 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 28.
Adding to 11000092852 its reverse (25829000011), we get a palindrome (36829092863).
The spelling of 11000092852 in words is "eleven billion, ninety-two thousand, eight hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •