Base | Representation |
---|---|
bin | 110011001110010000… |
… | …1000101001010101011 |
3 | 101111221002121001120012 |
4 | 1212130201011022223 |
5 | 3300240011200021 |
6 | 122311111522135 |
7 | 10642622265014 |
oct | 1463441051253 |
9 | 344832531505 |
10 | 110000100011 |
11 | 4271820926a |
12 | 1939a98934b |
13 | a4b0533599 |
14 | 547720c00b |
15 | 2cdc11735b |
hex | 199c8452ab |
110000100011 has 4 divisors (see below), whose sum is σ = 110000763792. Its totient is φ = 109999436232.
The previous prime is 110000099999. The next prime is 110000100019. The reversal of 110000100011 is 110001000011.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 110000100011 - 222 = 109995905707 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110000099968 and 110000100004.
It is not an unprimeable number, because it can be changed into a prime (110000100019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 147521 + ... + 491693.
It is an arithmetic number, because the mean of its divisors is an integer number (27500190948).
Almost surely, 2110000100011 is an apocalyptic number.
110000100011 is a deficient number, since it is larger than the sum of its proper divisors (663781).
110000100011 is an equidigital number, since it uses as much as digits as its factorization.
110000100011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 663780.
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 110000100011 its reverse (110001000011), we get a palindrome (220001100022).
The spelling of 110000100011 in words is "one hundred ten billion, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •