Base | Representation |
---|---|
bin | 10111001110000010110000… |
… | …111000011101010110101011 |
3 | 111101120120212001100120211110 |
4 | 113032002300320131112223 |
5 | 101341113441131120021 |
6 | 1001105155250201403 |
7 | 30336635345026626 |
oct | 2716026070352653 |
9 | 441516761316743 |
10 | 102120110020011 |
11 | 2a5a1993927806 |
12 | b55368a283263 |
13 | 44c9b67605b75 |
14 | 1b308d5486dbd |
15 | bc15a2236476 |
hex | 5ce0b0e1d5ab |
102120110020011 has 8 divisors (see below), whose sum is σ = 136166480104000. Its totient is φ = 68076906641352.
The previous prime is 102120110019943. The next prime is 102120110020067. The reversal of 102120110020011 is 110020011021201.
102120110020011 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102120110020011 - 215 = 102120109987243 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102120110020811) 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, 791601085 + ... + 791730078.
It is an arithmetic number, because the mean of its divisors is an integer number (17020810013000).
Almost surely, 2102120110020011 is an apocalyptic number.
102120110020011 is a deficient number, since it is larger than the sum of its proper divisors (34046370083989).
102120110020011 is a wasteful number, since it uses less digits than its factorization.
102120110020011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1583352665.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 102120110020011 its reverse (110020011021201), we get a palindrome (212140121041212).
The spelling of 102120110020011 in words is "one hundred two trillion, one hundred twenty billion, one hundred ten million, twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •