Base | Representation |
---|---|
bin | 10111001110000011101100… |
… | …011111100000001111100001 |
3 | 111101120200102202012111000220 |
4 | 113032003230133200033201 |
5 | 101341123013142024301 |
6 | 1001105442413433253 |
7 | 30340002210460446 |
oct | 2716035437401741 |
9 | 441520382174026 |
10 | 102121110111201 |
11 | 2a5a2357403055 |
12 | b55390919b829 |
13 | 44c9c968756bc |
14 | 1b3098c2199cd |
15 | bc160ee34936 |
hex | 5ce0ec7e03e1 |
102121110111201 has 8 divisors (see below), whose sum is σ = 136161916450080. Its totient is φ = 68080521923232.
The previous prime is 102121110111199. The next prime is 102121110111227. The reversal of 102121110111201 is 102111011121201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102121110111201 - 21 = 102121110111199 is a prime.
It is a super-2 number, since 2×1021211101112012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (102121110111271) 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, 53442300 + ... + 55320173.
It is an arithmetic number, because the mean of its divisors is an integer number (17020239556260).
Almost surely, 2102121110111201 is an apocalyptic number.
It is an amenable number.
102121110111201 is a deficient number, since it is larger than the sum of its proper divisors (34040806338879).
102121110111201 is a wasteful number, since it uses less digits than its factorization.
102121110111201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 109075455.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 102121110111201 its reverse (102111011121201), we get a palindrome (204232121232402).
The spelling of 102121110111201 in words is "one hundred two trillion, one hundred twenty-one billion, one hundred ten million, one hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •