Base | Representation |
---|---|
bin | 11101101101111100110… |
… | …11001000100011101101 |
3 | 10121121122100121202222202 |
4 | 32312332123020203231 |
5 | 113212204110030013 |
6 | 2101030544151245 |
7 | 133525601034350 |
oct | 16667633104355 |
9 | 3547570552882 |
10 | 1021102033133 |
11 | 3640575287a6 |
12 | 145a91008525 |
13 | 7539c086690 |
14 | 375c8c3a297 |
15 | 1b86411a858 |
hex | edbe6c88ed |
1021102033133 has 16 divisors (see below), whose sum is σ = 1311381878016. Its totient is φ = 772778603520.
The previous prime is 1021102033097. The next prime is 1021102033169. The reversal of 1021102033133 is 3313302011201.
It is an interprime number because it is at equal distance from previous prime (1021102033097) and next prime (1021102033169).
It is not a de Polignac number, because 1021102033133 - 220 = 1021100984557 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1021102033183) 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, 243930548 + ... + 243934733.
It is an arithmetic number, because the mean of its divisors is an integer number (81961367376).
Almost surely, 21021102033133 is an apocalyptic number.
1021102033133 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1021102033133 is a deficient number, since it is larger than the sum of its proper divisors (290279844883).
1021102033133 is a wasteful number, since it uses less digits than its factorization.
1021102033133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 487865324.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 1021102033133 its reverse (3313302011201), we get a palindrome (4334404044334).
The spelling of 1021102033133 in words is "one trillion, twenty-one billion, one hundred two million, thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •