Base | Representation |
---|---|
bin | 11101010010110000010… |
… | …001100111000110001101 |
3 | 21010102220120121000122022 |
4 | 131102300101213012031 |
5 | 230440112014214013 |
6 | 4140432125055525 |
7 | 265302032353322 |
oct | 35226021470615 |
9 | 7112816530568 |
10 | 2013002101133 |
11 | 706789230911 |
12 | 2861723b75a5 |
13 | 117a961c053a |
14 | 6d603604b49 |
15 | 375696e7008 |
hex | 1d4b046718d |
2013002101133 has 8 divisors (see below), whose sum is σ = 2164033614720. Its totient is φ = 1866478991040.
The previous prime is 2013002101111. The next prime is 2013002101139. The reversal of 2013002101133 is 3311012003102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2013002101133 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 (2013002101139) 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, 1127099948 + ... + 1127101733.
It is an arithmetic number, because the mean of its divisors is an integer number (270504201840).
Almost surely, 22013002101133 is an apocalyptic number.
It is an amenable number.
2013002101133 is a deficient number, since it is larger than the sum of its proper divisors (151031513587).
2013002101133 is a wasteful number, since it uses less digits than its factorization.
2013002101133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2254201747.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 2013002101133 its reverse (3311012003102), we get a palindrome (5324014104235).
The spelling of 2013002101133 in words is "two trillion, thirteen billion, two million, one hundred one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •