Base | Representation |
---|---|
bin | 10100100000101000… |
… | …00000110101100010 |
3 | 1001102101022211120121 |
4 | 22100110000311202 |
5 | 140022320200002 |
6 | 5020342030454 |
7 | 536602543240 |
oct | 122024006542 |
9 | 31371284517 |
10 | 11011100002 |
11 | 474052a451 |
12 | 217371842a |
13 | 1066312ab6 |
14 | 76655d790 |
15 | 446a33237 |
hex | 290500d62 |
11011100002 has 8 divisors (see below), whose sum is σ = 18876171456. Its totient is φ = 4719042852.
The previous prime is 11011099997. The next prime is 11011100003. The reversal of 11011100002 is 20000111011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is not an unprimeable number, because it can be changed into a prime (11011100003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 393253558 + ... + 393253585.
It is an arithmetic number, because the mean of its divisors is an integer number (2359521432).
Almost surely, 211011100002 is an apocalyptic number.
11011100002 is a deficient number, since it is larger than the sum of its proper divisors (7865071454).
11011100002 is an equidigital number, since it uses as much as digits as its factorization.
11011100002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 786507152.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 11011100002 its reverse (20000111011), we get a palindrome (31011211013).
The spelling of 11011100002 in words is "eleven billion, eleven million, one hundred thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •