Base | Representation |
---|---|
bin | 10111001101110000001110… |
… | …101111111100011111111111 |
3 | 111101111200111011222100012202 |
4 | 113031300032233330133333 |
5 | 101340302212230310421 |
6 | 1001052104452022115 |
7 | 30335332245524225 |
oct | 2715601657743777 |
9 | 441450434870182 |
10 | 102100210010111 |
11 | 2a594501892835 |
12 | b54b85590193b |
13 | 44c801586a391 |
14 | 1b2d96858cb15 |
15 | bc0cda16c10b |
hex | 5cdc0ebfc7ff |
102100210010111 has 8 divisors (see below), whose sum is σ = 107004586915680. Its totient is φ = 97234602882912.
The previous prime is 102100210010089. The next prime is 102100210010147. The reversal of 102100210010111 is 111010012001201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102100210010111 - 238 = 101825332103167 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102100210010092 and 102100210010101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102100210018111) 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, 9692439200 + ... + 9692449733.
It is an arithmetic number, because the mean of its divisors is an integer number (13375573364460).
Almost surely, 2102100210010111 is an apocalyptic number.
102100210010111 is a deficient number, since it is larger than the sum of its proper divisors (4904376905569).
102100210010111 is a wasteful number, since it uses less digits than its factorization.
102100210010111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19384889185.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 102100210010111 its reverse (111010012001201), we get a palindrome (213110222011312).
The spelling of 102100210010111 in words is "one hundred two trillion, one hundred billion, two hundred ten million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •