Base | Representation |
---|---|
bin | 1010000111011101100110… |
… | …1110101000100100010011 |
3 | 1110101101020112000211220211 |
4 | 2201313121232220210103 |
5 | 2424221031220210003 |
6 | 35353552323544551 |
7 | 2225430214156534 |
oct | 241673156504423 |
9 | 43341215024824 |
10 | 11123323210003 |
11 | 35a9413a70984 |
12 | 12b793652b157 |
13 | 628c03c58c74 |
14 | 2a652bdba68b |
15 | 14452329996d |
hex | a1dd9ba8913 |
11123323210003 has 8 divisors (see below), whose sum is σ = 11691668194848. Its totient is φ = 10562038411584.
The previous prime is 11123323209953. The next prime is 11123323210009. The reversal of 11123323210003 is 30001232332111.
11123323210003 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 11123323210003 - 233 = 11114733275411 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11123323210009) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1765043376 + ... + 1765049677.
It is an arithmetic number, because the mean of its divisors is an integer number (1461458524356).
Almost surely, 211123323210003 is an apocalyptic number.
11123323210003 is a deficient number, since it is larger than the sum of its proper divisors (568344984845).
11123323210003 is a wasteful number, since it uses less digits than its factorization.
11123323210003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3530093213.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 11123323210003 its reverse (30001232332111), we get a palindrome (41124555542114).
The spelling of 11123323210003 in words is "eleven trillion, one hundred twenty-three billion, three hundred twenty-three million, two hundred ten thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •