Base | Representation |
---|---|
bin | 11101010010110000010… |
… | …010000111010100001101 |
3 | 21010102220120211201200000 |
4 | 131102300102013110031 |
5 | 230440112032424401 |
6 | 4140432131554513 |
7 | 265302033443136 |
oct | 35226022072415 |
9 | 7112816751600 |
10 | 2013002233101 |
11 | 706789310a82 |
12 | 28617245ba39 |
13 | 117a96238622 |
14 | 6d60363ac8d |
15 | 37569721186 |
hex | 1d4b048750d |
2013002233101 has 24 divisors (see below), whose sum is σ = 3017271610080. Its totient is φ = 1341151327152.
The previous prime is 2013002233043. The next prime is 2013002233169. The reversal of 2013002233101 is 1013322003102.
2013002233101 is a `hidden beast` number, since 2 + 0 + 130 + 0 + 223 + 310 + 1 = 666.
It is not a de Polignac number, because 2013002233101 - 210 = 2013002232077 is a prime.
It is a super-2 number, since 2×20130022331012 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2013002233171) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2239470 + ... + 3006863.
It is an arithmetic number, because the mean of its divisors is an integer number (125719650420).
Almost surely, 22013002233101 is an apocalyptic number.
It is an amenable number.
2013002233101 is a deficient number, since it is larger than the sum of its proper divisors (1004269376979).
2013002233101 is an equidigital number, since it uses as much as digits as its factorization.
2013002233101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5247927 (or 5247915 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 2013002233101 its reverse (1013322003102), we get a palindrome (3026324236203).
The spelling of 2013002233101 in words is "two trillion, thirteen billion, two million, two hundred thirty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •