Base | Representation |
---|---|
bin | 10000000001011111010… |
… | …001101100100001100001 |
3 | 10220021011020220210112211 |
4 | 100001133101230201201 |
5 | 121020033141231423 |
6 | 2201502030522121 |
7 | 142360351303600 |
oct | 20013721544141 |
9 | 3807136823484 |
10 | 1101110102113 |
11 | 394a83a4615a |
12 | 15949b666341 |
13 | 7caaca85128 |
14 | 3b418ab5a37 |
15 | 1d99818010d |
hex | 1005f46c861 |
1101110102113 has 6 divisors (see below), whose sum is σ = 1280883180066. Its totient is φ = 943808658912.
The previous prime is 1101110102107. The next prime is 1101110102153. The reversal of 1101110102113 is 3112010111011.
It can be written as a sum of positive squares in only one way, i.e., 1097786349009 + 3323753104 = 1047753^2 + 57652^2 .
It is not a de Polignac number, because 1101110102113 - 29 = 1101110101601 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1101110102093 and 1101110102102.
It is not an unprimeable number, because it can be changed into a prime (1101110102153) 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, 11235817320 + ... + 11235817417.
It is an arithmetic number, because the mean of its divisors is an integer number (213480530011).
Almost surely, 21101110102113 is an apocalyptic number.
It is an amenable number.
1101110102113 is a deficient number, since it is larger than the sum of its proper divisors (179773077953).
1101110102113 is an equidigital number, since it uses as much as digits as its factorization.
1101110102113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22471634751 (or 22471634744 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 13.
Adding to 1101110102113 its reverse (3112010111011), we get a palindrome (4213120213124).
The spelling of 1101110102113 in words is "one trillion, one hundred one billion, one hundred ten million, one hundred two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •