Base | Representation |
---|---|
bin | 1010000110001110100111… |
… | …1010110110100110110101 |
3 | 1110022100111211110210120222 |
4 | 2201203221322312212311 |
5 | 2423344120210342323 |
6 | 35340124333504125 |
7 | 2224046612025416 |
oct | 241435172664665 |
9 | 43270454423528 |
10 | 11102120012213 |
11 | 35a042335161a |
12 | 12b37b9642045 |
13 | 626c0520a499 |
14 | 2a54b9db180d |
15 | 143bd1ab09c8 |
hex | a18e9eb69b5 |
11102120012213 has 2 divisors, whose sum is σ = 11102120012214. Its totient is φ = 11102120012212.
The previous prime is 11102120012167. The next prime is 11102120012267. The reversal of 11102120012213 is 31221002120111.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10609397440849 + 492722571364 = 3257207^2 + 701942^2 .
It is a cyclic number.
It is not a de Polignac number, because 11102120012213 - 26 = 11102120012149 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11102120012191 and 11102120012200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11102120092213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5551060006106 + 5551060006107.
It is an arithmetic number, because the mean of its divisors is an integer number (5551060006107).
Almost surely, 211102120012213 is an apocalyptic number.
It is an amenable number.
11102120012213 is a deficient number, since it is larger than the sum of its proper divisors (1).
11102120012213 is an equidigital number, since it uses as much as digits as its factorization.
11102120012213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 11102120012213 its reverse (31221002120111), we get a palindrome (42323122132324).
The spelling of 11102120012213 in words is "eleven trillion, one hundred two billion, one hundred twenty million, twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •