Base | Representation |
---|---|
bin | 1010010001110000100110… |
… | …1110110011011011100011 |
3 | 1111000021211220201122121000 |
4 | 2210130021232303123203 |
5 | 2440120323342020003 |
6 | 40011130031403043 |
7 | 2244262020016503 |
oct | 244341156633343 |
9 | 44007756648530 |
10 | 11300222220003 |
11 | 3667440935402 |
12 | 1326085683483 |
13 | 63c7b62b9992 |
14 | 2b0d10001a03 |
15 | 148e286111a3 |
hex | a4709bb36e3 |
11300222220003 has 32 divisors (see below), whose sum is σ = 16789180953600. Its totient is φ = 7511835240000.
The previous prime is 11300222219969. The next prime is 11300222220019. The reversal of 11300222220003 is 30002222200311.
It is not a de Polignac number, because 11300222220003 - 212 = 11300222215907 is a prime.
It is a super-3 number, since 3×113002222200033 (a number of 40 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (11300222220403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 125973858 + ... + 126063528.
It is an arithmetic number, because the mean of its divisors is an integer number (524661904800).
Almost surely, 211300222220003 is an apocalyptic number.
11300222220003 is a deficient number, since it is larger than the sum of its proper divisors (5488958733597).
11300222220003 is a wasteful number, since it uses less digits than its factorization.
11300222220003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103040 (or 103034 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 11300222220003 its reverse (30002222200311), we get a palindrome (41302444420314).
The spelling of 11300222220003 in words is "eleven trillion, three hundred billion, two hundred twenty-two million, two hundred twenty thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •