Base | Representation |
---|---|
bin | 10111001110000010110000… |
… | …010010101010011010001011 |
3 | 111101120120211100201012121111 |
4 | 113032002300102222122023 |
5 | 101341113431112041021 |
6 | 1001105154253551151 |
7 | 30336635164562422 |
oct | 2716026022523213 |
9 | 441516740635544 |
10 | 102120100112011 |
11 | 2a5a198927a783 |
12 | b553686aa54b7 |
13 | 44c9b65547147 |
14 | 1b308d40282b9 |
15 | bc15a142a8e1 |
hex | 5ce0b04aa68b |
102120100112011 has 8 divisors (see below), whose sum is σ = 102491835325920. Its totient is φ = 101748386989248.
The previous prime is 102120100111961. The next prime is 102120100112027. The reversal of 102120100112011 is 110211001021201.
It is a happy number.
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 102120100112011 - 29 = 102120100111499 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102120100111982 and 102120100112000.
It is not an unprimeable number, because it can be changed into a prime (102120100113011) 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, 3767775 + ... + 14779591.
It is an arithmetic number, because the mean of its divisors is an integer number (12811479415740).
Almost surely, 2102120100112011 is an apocalyptic number.
102120100112011 is a deficient number, since it is larger than the sum of its proper divisors (371735213909).
102120100112011 is a wasteful number, since it uses less digits than its factorization.
102120100112011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11045573.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 102120100112011 its reverse (110211001021201), we get a palindrome (212331101133212).
The spelling of 102120100112011 in words is "one hundred two trillion, one hundred twenty billion, one hundred million, one hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •