Base | Representation |
---|---|
bin | 11101010010110110101… |
… | …110011010000100000101 |
3 | 21010110012010012202201102 |
4 | 131102312232122010011 |
5 | 230440322220010341 |
6 | 4140450552305445 |
7 | 265304515220420 |
oct | 35226656320405 |
9 | 7113163182642 |
10 | 2013110313221 |
11 | 706834321197 |
12 | 2861a26a2285 |
13 | 117ab274ab67 |
14 | 6d613b329b7 |
15 | 37573e6ec9b |
hex | 1d4b6b9a105 |
2013110313221 has 32 divisors (see below), whose sum is σ = 2352305940480. Its totient is φ = 1687051469376.
The previous prime is 2013110313187. The next prime is 2013110313233. The reversal of 2013110313221 is 1223130113102.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-2013110313221 is a prime.
It is a super-2 number, since 2×20131103132212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2013110313193 and 2013110313202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2013110313521) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 222021530 + ... + 222030596.
It is an arithmetic number, because the mean of its divisors is an integer number (73509560640).
Almost surely, 22013110313221 is an apocalyptic number.
It is an amenable number.
2013110313221 is a deficient number, since it is larger than the sum of its proper divisors (339195627259).
2013110313221 is a wasteful number, since it uses less digits than its factorization.
2013110313221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11153.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 2013110313221 its reverse (1223130113102), we get a palindrome (3236240426323).
The spelling of 2013110313221 in words is "two trillion, thirteen billion, one hundred ten million, three hundred thirteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •