Base | Representation |
---|---|
bin | 1010000000110111011100… |
… | …1000111001010001100111 |
3 | 1102222112201211102022120121 |
4 | 2200031313020321101213 |
5 | 2420341440000000403 |
6 | 35225531342142411 |
7 | 2214306030605506 |
oct | 240156710712147 |
9 | 42875654368517 |
10 | 11010000000103 |
11 | 3565350a74005 |
12 | 129998a881a07 |
13 | 61b314111590 |
14 | 2a0c5b6d883d |
15 | 1415de5673bd |
hex | a0377239467 |
11010000000103 has 4 divisors (see below), whose sum is σ = 11856923077048. Its totient is φ = 10163076923160.
The previous prime is 11010000000031. The next prime is 11010000000107. The reversal of 11010000000103 is 30100000001011.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11010000000103 - 217 = 11009999869031 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11010000000107) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 423461538453 + ... + 423461538478.
It is an arithmetic number, because the mean of its divisors is an integer number (2964230769262).
Almost surely, 211010000000103 is an apocalyptic number.
11010000000103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
11010000000103 is a deficient number, since it is larger than the sum of its proper divisors (846923076945).
11010000000103 is an equidigital number, since it uses as much as digits as its factorization.
11010000000103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 846923076944.
The product of its (nonzero) digits is 3, while the sum is 7.
Adding to 11010000000103 its reverse (30100000001011), we get a palindrome (41110000001114).
The spelling of 11010000000103 in words is "eleven trillion, ten billion, one hundred three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •