Base | Representation |
---|---|
bin | 10111001100011101001010… |
… | …001101101000000010001101 |
3 | 111101012011020220200200002221 |
4 | 113030131022031220002031 |
5 | 101332322023403130013 |
6 | 1000543113525415341 |
7 | 30326024002344262 |
oct | 2714351215500215 |
9 | 441164226620087 |
10 | 102011013333133 |
11 | 2a55a69a672173 |
12 | b536501b6a551 |
13 | 44bc79c2c2688 |
14 | 1b29506243269 |
15 | bbd8195c208d |
hex | 5cc74a36808d |
102011013333133 has 16 divisors (see below), whose sum is σ = 104800962898944. Its totient is φ = 99222799314240.
The previous prime is 102011013333029. The next prime is 102011013333157. The reversal of 102011013333133 is 331333310110201.
It is a cyclic number.
It is not a de Polignac number, because 102011013333133 - 221 = 102011011235981 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102011013333098 and 102011013333107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102011013343133) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2715423316 + ... + 2715460882.
It is an arithmetic number, because the mean of its divisors is an integer number (6550060181184).
Almost surely, 2102011013333133 is an apocalyptic number.
It is an amenable number.
102011013333133 is a deficient number, since it is larger than the sum of its proper divisors (2789949565811).
102011013333133 is a wasteful number, since it uses less digits than its factorization.
102011013333133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58692.
The product of its (nonzero) digits is 1458, while the sum is 25.
Adding to 102011013333133 its reverse (331333310110201), we get a palindrome (433344323443334).
The spelling of 102011013333133 in words is "one hundred two trillion, eleven billion, thirteen million, three hundred thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •