Base | Representation |
---|---|
bin | 10111001101110000001001… |
… | …011001010110101100011011 |
3 | 111101111200020220222121122211 |
4 | 113031300021121112230123 |
5 | 101340302021232431021 |
6 | 1001052051523055551 |
7 | 30335330105261101 |
oct | 2715601131265433 |
9 | 441450226877584 |
10 | 102100120202011 |
11 | 2a594466122668 |
12 | b54b82b8115b7 |
13 | 44c80000848a9 |
14 | 1b2d95a691c71 |
15 | bc0cd232c3e1 |
hex | 5cdc09656b1b |
102100120202011 has 8 divisors (see below), whose sum is σ = 109976006052864. Its totient is φ = 94510630200360.
The previous prime is 102100120201969. The next prime is 102100120202029. The reversal of 102100120202011 is 110202021001201.
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 102100120202011 - 241 = 99901096946459 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102100120201982 and 102100120202000.
It is not an unprimeable number, because it can be changed into a prime (102100120202051) 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, 71598961561 + ... + 71598962986.
It is an arithmetic number, because the mean of its divisors is an integer number (13747000756608).
Almost surely, 2102100120202011 is an apocalyptic number.
102100120202011 is a deficient number, since it is larger than the sum of its proper divisors (7875885850853).
102100120202011 is a wasteful number, since it uses less digits than its factorization.
102100120202011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 143197924601.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 102100120202011 its reverse (110202021001201), we get a palindrome (212302141203212).
The spelling of 102100120202011 in words is "one hundred two trillion, one hundred billion, one hundred twenty million, two hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •