Base | Representation |
---|---|
bin | 10111001111010111100000… |
… | …010111111001000000110001 |
3 | 111101220021201101010111000220 |
4 | 113033113200113321000301 |
5 | 101344111313340232004 |
6 | 1001215044233003253 |
7 | 30346336240332465 |
oct | 2717274027710061 |
9 | 441807641114026 |
10 | 102211101102129 |
11 | 2a627536a30528 |
12 | b569242b53529 |
13 | 4505608862166 |
14 | 1b35087c504a5 |
15 | bc3b2a5d1dd9 |
hex | 5cf5e05f9031 |
102211101102129 has 4 divisors (see below), whose sum is σ = 136281468136176. Its totient is φ = 68140734068084.
The previous prime is 102211101102091. The next prime is 102211101102161. The reversal of 102211101102129 is 921201101112201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 102211101102129 - 215 = 102211101069361 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102211101102099 and 102211101102108.
It is not an unprimeable number, because it can be changed into a prime (102211101102329) 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, 17035183517019 + ... + 17035183517024.
It is an arithmetic number, because the mean of its divisors is an integer number (34070367034044).
Almost surely, 2102211101102129 is an apocalyptic number.
It is an amenable number.
102211101102129 is a deficient number, since it is larger than the sum of its proper divisors (34070367034047).
102211101102129 is an equidigital number, since it uses as much as digits as its factorization.
102211101102129 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34070367034046.
The product of its (nonzero) digits is 144, while the sum is 24.
The spelling of 102211101102129 in words is "one hundred two trillion, two hundred eleven billion, one hundred one million, one hundred two thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •