Base | Representation |
---|---|
bin | 11101001010011001000… |
… | …01011101110001111001 |
3 | 10112210100212220001011220 |
4 | 32211030201131301321 |
5 | 112404104333033423 |
6 | 2044152333542253 |
7 | 132251525564310 |
oct | 16451441356171 |
9 | 3483325801156 |
10 | 1002011221113 |
11 | 356a50237101 |
12 | 142243644989 |
13 | 73648b714c6 |
14 | 366d75c3277 |
15 | 1b0e80e39e3 |
hex | e94c85dc79 |
1002011221113 has 16 divisors (see below), whose sum is σ = 1527328911360. Its totient is φ = 572407339536.
The previous prime is 1002011221073. The next prime is 1002011221151. The reversal of 1002011221113 is 3111221102001.
It is not a de Polignac number, because 1002011221113 - 29 = 1002011220601 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1002011221092 and 1002011221101.
It is not an unprimeable number, because it can be changed into a prime (1002011220113) 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, 7031995 + ... + 7173072.
It is an arithmetic number, because the mean of its divisors is an integer number (95458056960).
Almost surely, 21002011221113 is an apocalyptic number.
It is an amenable number.
1002011221113 is a deficient number, since it is larger than the sum of its proper divisors (525317690247).
1002011221113 is a wasteful number, since it uses less digits than its factorization.
1002011221113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14208436.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 1002011221113 its reverse (3111221102001), we get a palindrome (4113232323114).
The spelling of 1002011221113 in words is "one trillion, two billion, eleven million, two hundred twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •