Base | Representation |
---|---|
bin | 11101010011000010110… |
… | …100110000001100100011 |
3 | 21010110201021011201210122 |
4 | 131103002310300030203 |
5 | 230441231201201311 |
6 | 4140523043150455 |
7 | 265312531500341 |
oct | 35230264601443 |
9 | 7113637151718 |
10 | 2013313303331 |
11 | 706928966710 |
12 | 28623a67542b |
13 | 117b15811155 |
14 | 6d632a92991 |
15 | 37586bba0db |
hex | 1d4c2d30323 |
2013313303331 has 16 divisors (see below), whose sum is σ = 2255775432288. Its totient is φ = 1780759987200.
The previous prime is 2013313303303. The next prime is 2013313303333. The reversal of 2013313303331 is 1333033133102.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 2013313303331 - 214 = 2013313286947 is a prime.
It is a super-2 number, since 2×20133133033312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2013313303331.
It is not an unprimeable number, because it can be changed into a prime (2013313303333) 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, 16937501 + ... + 17055953.
It is an arithmetic number, because the mean of its divisors is an integer number (140985964518).
Almost surely, 22013313303331 is an apocalyptic number.
2013313303331 is a deficient number, since it is larger than the sum of its proper divisors (242462128957).
2013313303331 is a wasteful number, since it uses less digits than its factorization.
2013313303331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 160262.
The product of its (nonzero) digits is 4374, while the sum is 26.
Adding to 2013313303331 its reverse (1333033133102), we get a palindrome (3346346436433).
The spelling of 2013313303331 in words is "two trillion, thirteen billion, three hundred thirteen million, three hundred three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •