Base | Representation |
---|---|
bin | 10111001100010011000000… |
… | …011000111110111101010011 |
3 | 111101011010010010020212112011 |
4 | 113030103000120332331103 |
5 | 101332132211421321321 |
6 | 1000534112033243351 |
7 | 30325156561146043 |
oct | 2714230030767523 |
9 | 441133103225464 |
10 | 102000111120211 |
11 | 2a556005654247 |
12 | b53437aa03557 |
13 | 44bb752715505 |
14 | 1b28b90349723 |
15 | bbd3cc3ebae1 |
hex | 5cc4c063ef53 |
102000111120211 has 8 divisors (see below), whose sum is σ = 108002826298224. Its totient is φ = 95997696902400.
The previous prime is 102000111120203. The next prime is 102000111120227. The reversal of 102000111120211 is 112021111000201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102000111120211 - 23 = 102000111120203 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102000111120191 and 102000111120200.
It is not an unprimeable number, because it can be changed into a prime (102000111120251) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 74542090 + ... + 75898111.
It is an arithmetic number, because the mean of its divisors is an integer number (13500353287278).
Almost surely, 2102000111120211 is an apocalyptic number.
102000111120211 is a deficient number, since it is larger than the sum of its proper divisors (6002715178013).
102000111120211 is a wasteful number, since it uses less digits than its factorization.
102000111120211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 150480101.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 102000111120211 its reverse (112021111000201), we get a palindrome (214021222120412).
The spelling of 102000111120211 in words is "one hundred two trillion, one hundred eleven million, one hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •