Base | Representation |
---|---|
bin | 1010000001101001000110… |
… | …1110101000101011011111 |
3 | 1110000211010220001102210110 |
4 | 2200122101232220223133 |
5 | 2421101240214044403 |
6 | 35240014235541103 |
7 | 2215260263346456 |
oct | 240322156505337 |
9 | 43024126042713 |
10 | 11023331003103 |
11 | 356aa71a78961 |
12 | 12a048b2ba793 |
13 | 61c659c47733 |
14 | 2a1763dc7b9d |
15 | 141b1ea9e103 |
hex | a0691ba8adf |
11023331003103 has 16 divisors (see below), whose sum is σ = 15101744216832. Its totient is φ = 7147985592000.
The previous prime is 11023331003089. The next prime is 11023331003147. The reversal of 11023331003103 is 30130013332011.
11023331003103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11023331003103 - 28 = 11023331002847 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11023331003103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11023331003803) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 135337803 + ... + 135419228.
It is an arithmetic number, because the mean of its divisors is an integer number (943859013552).
Almost surely, 211023331003103 is an apocalyptic number.
11023331003103 is a deficient number, since it is larger than the sum of its proper divisors (4078413213729).
11023331003103 is a wasteful number, since it uses less digits than its factorization.
11023331003103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 270757406.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 11023331003103 its reverse (30130013332011), we get a palindrome (41153344335114).
The spelling of 11023331003103 in words is "eleven trillion, twenty-three billion, three hundred thirty-one million, three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •