Base | Representation |
---|---|
bin | 10111001100010011000001… |
… | …000011010000000010010011 |
3 | 111101011010010220002210102112 |
4 | 113030103001003100002103 |
5 | 101332132222240401321 |
6 | 1000534113110535535 |
7 | 30325160054264204 |
oct | 2714230103200223 |
9 | 441133126083375 |
10 | 102000122200211 |
11 | 2a556010931874 |
12 | b5343826675ab |
13 | 44bb754ac4821 |
14 | 1b28b919d15ab |
15 | bbd3cd389a5b |
hex | 5cc4c10d0093 |
102000122200211 has 4 divisors (see below), whose sum is σ = 102078403185552. Its totient is φ = 101921841214872.
The previous prime is 102000122200201. The next prime is 102000122200217. The reversal of 102000122200211 is 112002221000201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 102000122200211 - 246 = 31631378022547 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102000122200217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 39140490716 + ... + 39140493321.
It is an arithmetic number, because the mean of its divisors is an integer number (25519600796388).
Almost surely, 2102000122200211 is an apocalyptic number.
102000122200211 is a deficient number, since it is larger than the sum of its proper divisors (78280985341).
102000122200211 is an equidigital number, since it uses as much as digits as its factorization.
102000122200211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78280985340.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 102000122200211 its reverse (112002221000201), we get a palindrome (214002343200412).
The spelling of 102000122200211 in words is "one hundred two trillion, one hundred twenty-two million, two hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.036 sec. • engine limits •