Base | Representation |
---|---|
bin | 111011111111101… |
… | …1010010000100011 |
3 | 12012022000122120221 |
4 | 1313333122100203 |
5 | 13110324030311 |
6 | 531431543511 |
7 | 100613110150 |
oct | 16777322043 |
9 | 5168018527 |
10 | 2013111331 |
11 | 943392380 |
12 | 48222ab97 |
13 | 2610b814a |
14 | 15150d227 |
15 | bbb02671 |
hex | 77fda423 |
2013111331 has 8 divisors (see below), whose sum is σ = 2509853184. Its totient is φ = 1568658120.
The previous prime is 2013111323. The next prime is 2013111337. The reversal of 2013111331 is 1331113102.
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 2013111331 - 23 = 2013111323 is a prime.
It is a super-2 number, since 2×20131113312 = 8105234462001183122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2013111337) 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, 13072075 + ... + 13072228.
It is an arithmetic number, because the mean of its divisors is an integer number (313731648).
Almost surely, 22013111331 is an apocalyptic number.
2013111331 is a deficient number, since it is larger than the sum of its proper divisors (496741853).
2013111331 is a wasteful number, since it uses less digits than its factorization.
2013111331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26144321.
The product of its (nonzero) digits is 54, while the sum is 16.
The square root of 2013111331 is about 44867.7092238951. The cubic root of 2013111331 is about 1262.6682623299.
Adding to 2013111331 its reverse (1331113102), we get a palindrome (3344224433).
The spelling of 2013111331 in words is "two billion, thirteen million, one hundred eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •