Base | Representation |
---|---|
bin | 100000001011011100011… |
… | …101111000011011111011 |
3 | 21211101210010200020022222 |
4 | 200023130131320123323 |
5 | 242212231333323003 |
6 | 4411510202434255 |
7 | 315522241651004 |
oct | 40133435703373 |
9 | 7741703606288 |
10 | 2211312011003 |
11 | 7828a2a88307 |
12 | 2b8697b0298b |
13 | 1306ab322984 |
14 | 790570601ab |
15 | 3c7c45c3c38 |
hex | 202dc7786fb |
2211312011003 has 8 divisors (see below), whose sum is σ = 2277150221808. Its totient is φ = 2146128907104.
The previous prime is 2211312010979. The next prime is 2211312011039. The reversal of 2211312011003 is 3001102131122.
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 2211312011003 - 210 = 2211312009979 is a prime.
It is a super-2 number, since 2×22113120110032 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2211312011303) 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 7 ways as a sum of consecutive naturals, for example, 163769876 + ... + 163783377.
It is an arithmetic number, because the mean of its divisors is an integer number (284643777726).
Almost surely, 22211312011003 is an apocalyptic number.
2211312011003 is a deficient number, since it is larger than the sum of its proper divisors (65838210805).
2211312011003 is a wasteful number, since it uses less digits than its factorization.
2211312011003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 327553453.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 2211312011003 its reverse (3001102131122), we get a palindrome (5212414142125).
The spelling of 2211312011003 in words is "two trillion, two hundred eleven billion, three hundred twelve million, eleven thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •