Base | Representation |
---|---|
bin | 10100110001010011… |
… | …01011000111111001 |
3 | 1001210010120021202102 |
4 | 22120221223013321 |
5 | 140314123332321 |
6 | 5042300313145 |
7 | 543221621210 |
oct | 123051530771 |
9 | 31703507672 |
10 | 11150995961 |
11 | 48024a0346 |
12 | 21b25427b5 |
13 | 10892b4981 |
14 | 77ad78077 |
15 | 453e68c0b |
hex | 298a6b1f9 |
11150995961 has 8 divisors (see below), whose sum is σ = 12745068864. Its totient is φ = 9557191440.
The previous prime is 11150995903. The next prime is 11150995969. The reversal of 11150995961 is 16959905111.
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 11150995961 - 210 = 11150994937 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11150995969) 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, 31631 + ... + 152651.
It is an arithmetic number, because the mean of its divisors is an integer number (1593133608).
Almost surely, 211150995961 is an apocalyptic number.
It is an amenable number.
11150995961 is a deficient number, since it is larger than the sum of its proper divisors (1594072903).
11150995961 is a wasteful number, since it uses less digits than its factorization.
11150995961 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 134191.
The product of its (nonzero) digits is 109350, while the sum is 47.
The spelling of 11150995961 in words is "eleven billion, one hundred fifty million, nine hundred ninety-five thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •