Base | Representation |
---|---|
bin | 10111001110000010101010… |
… | …011100110001101111110011 |
3 | 111101120120120112021200200211 |
4 | 113032002222130301233303 |
5 | 101341113231014201321 |
6 | 1001105140433124551 |
7 | 30336632564520634 |
oct | 2716025234615763 |
9 | 441516515250624 |
10 | 102120002100211 |
11 | 2a5a1938a16a97 |
12 | b55365a0b9757 |
13 | 44c9b4b14b5b4 |
14 | 1b308c4dd388b |
15 | bc1597a1a0e1 |
hex | 5ce0aa731bf3 |
102120002100211 has 4 divisors (see below), whose sum is σ = 102684201007024. Its totient is φ = 101555803193400.
The previous prime is 102120002100203. The next prime is 102120002100223. The reversal of 102120002100211 is 112001200021201.
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 102120002100211 - 23 = 102120002100203 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102120002100191 and 102120002100200.
It is not an unprimeable number, because it can be changed into a prime (102120003100211) 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, 282099453135 + ... + 282099453496.
It is an arithmetic number, because the mean of its divisors is an integer number (25671050251756).
Almost surely, 2102120002100211 is an apocalyptic number.
102120002100211 is a deficient number, since it is larger than the sum of its proper divisors (564198906813).
102120002100211 is an equidigital number, since it uses as much as digits as its factorization.
102120002100211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 564198906812.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 102120002100211 its reverse (112001200021201), we get a palindrome (214121202121412).
The spelling of 102120002100211 in words is "one hundred two trillion, one hundred twenty billion, two million, one hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •