Base | Representation |
---|---|
bin | 1010000000010011000011… |
… | …1011011001001100001111 |
3 | 1102221121112002102122121022 |
4 | 2200010300323121030033 |
5 | 2420211433410333403 |
6 | 35221234210424355 |
7 | 2213512002162251 |
oct | 240046073311417 |
9 | 42847462378538 |
10 | 11000232121103 |
11 | 3561199290a35 |
12 | 1297b035920bb |
13 | 61a418546914 |
14 | 2a05b2319cd1 |
15 | 14121bc5ad38 |
hex | a0130ed930f |
11000232121103 has 8 divisors (see below), whose sum is σ = 11022193404768. Its totient is φ = 10978289603424.
The previous prime is 11000232121027. The next prime is 11000232121181. The reversal of 11000232121103 is 30112123200011.
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 11000232121103 - 28 = 11000232120847 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 (11000232141103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3517676 + ... + 5862977.
It is an arithmetic number, because the mean of its divisors is an integer number (1377774175596).
Almost surely, 211000232121103 is an apocalyptic number.
11000232121103 is a deficient number, since it is larger than the sum of its proper divisors (21961283665).
11000232121103 is an equidigital number, since it uses as much as digits as its factorization.
11000232121103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9382993.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 11000232121103 its reverse (30112123200011), we get a palindrome (41112355321114).
The spelling of 11000232121103 in words is "eleven trillion, two hundred thirty-two million, one hundred twenty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •