Base | Representation |
---|---|
bin | 10010101110000111… |
… | …010011100111100101 |
3 | 1220212212121121211011 |
4 | 102232013103213211 |
5 | 312131330121013 |
6 | 13122334342221 |
7 | 1311056565145 |
oct | 225607234745 |
9 | 56785547734 |
10 | 20101020133 |
11 | 8585557a37 |
12 | 3a8b95a971 |
13 | 1b845b786c |
14 | d898a0925 |
15 | 7c9a72c3d |
hex | 4ae1d39e5 |
20101020133 has 8 divisors (see below), whose sum is σ = 21284985600. Its totient is φ = 18917227200.
The previous prime is 20101020127. The next prime is 20101020139. The reversal of 20101020133 is 33102010102.
It is an interprime number because it is at equal distance from previous prime (20101020127) and next prime (20101020139).
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 20101020133 - 221 = 20098922981 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20101020139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 256108 + ... + 325258.
It is an arithmetic number, because the mean of its divisors is an integer number (2660623200).
Almost surely, 220101020133 is an apocalyptic number.
It is an amenable number.
20101020133 is a deficient number, since it is larger than the sum of its proper divisors (1183965467).
20101020133 is a wasteful number, since it uses less digits than its factorization.
20101020133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86267.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 20101020133 its reverse (33102010102), we get a palindrome (53203030235).
The spelling of 20101020133 in words is "twenty billion, one hundred one million, twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •