Base | Representation |
---|---|
bin | 11101011011011000011… |
… | …11011011110110010001 |
3 | 10120122220121200200002200 |
4 | 32231230033123312101 |
5 | 113031300111100423 |
6 | 2052301435433413 |
7 | 133023553145646 |
oct | 16555417336621 |
9 | 3518817620080 |
10 | 1011133300113 |
11 | 35a90142a072 |
12 | 143b6a5b5869 |
13 | 744709c5aa1 |
14 | 36d20cd5dcd |
15 | 1b47dd86d43 |
hex | eb6c3dbd91 |
1011133300113 has 6 divisors (see below), whose sum is σ = 1460525877954. Its totient is φ = 674088866736.
The previous prime is 1011133300103. The next prime is 1011133300129. The reversal of 1011133300113 is 3110033311101.
It can be written as a sum of positive squares in only one way, i.e., 993953168784 + 17180131329 = 996972^2 + 131073^2 .
It is not a de Polignac number, because 1011133300113 - 213 = 1011133291921 is a prime.
It is a super-2 number, since 2×10111333001132 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1011133300103) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 56174072220 + ... + 56174072237.
It is an arithmetic number, because the mean of its divisors is an integer number (243420979659).
Almost surely, 21011133300113 is an apocalyptic number.
It is an amenable number.
1011133300113 is a deficient number, since it is larger than the sum of its proper divisors (449392577841).
1011133300113 is a wasteful number, since it uses less digits than its factorization.
1011133300113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 112348144463 (or 112348144460 counting only the distinct ones).
The product of its (nonzero) digits is 81, while the sum is 18.
Adding to 1011133300113 its reverse (3110033311101), we get a palindrome (4121166611214).
The spelling of 1011133300113 in words is "one trillion, eleven billion, one hundred thirty-three million, three hundred thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •