Base | Representation |
---|---|
bin | 1011111010101001100101… |
… | …0011001101100101001011 |
3 | 1201101120010101121111020211 |
4 | 2332222121103031211023 |
5 | 3204131322341000321 |
6 | 43511024445101551 |
7 | 2521414165112431 |
oct | 276523123154513 |
9 | 51346111544224 |
10 | 13102222203211 |
11 | 41a169194aa79 |
12 | 157736b8578b7 |
13 | 7406c39a16ab |
14 | 334218262d51 |
15 | 17ac43a270e1 |
hex | bea994cd94b |
13102222203211 has 4 divisors (see below), whose sum is σ = 13102290310392. Its totient is φ = 13102154096032.
The previous prime is 13102222203151. The next prime is 13102222203271. The reversal of 13102222203211 is 11230222220131.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (13102222203151) and next prime (13102222203271).
It is a cyclic number.
It is not a de Polignac number, because 13102222203211 - 223 = 13102213814603 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13102222203271) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33764206 + ... + 34150051.
It is an arithmetic number, because the mean of its divisors is an integer number (3275572577598).
Almost surely, 213102222203211 is an apocalyptic number.
13102222203211 is a deficient number, since it is larger than the sum of its proper divisors (68107181).
13102222203211 is an equidigital number, since it uses as much as digits as its factorization.
13102222203211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 68107180.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 13102222203211 its reverse (11230222220131), we get a palindrome (24332444423342).
The spelling of 13102222203211 in words is "thirteen trillion, one hundred two billion, two hundred twenty-two million, two hundred three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •