Base | Representation |
---|---|
bin | 111100000000000… |
… | …1011010100110111 |
3 | 12012022101212021122 |
4 | 1320000023110313 |
5 | 13110401443221 |
6 | 531440134155 |
7 | 100614605123 |
oct | 17000132467 |
9 | 5168355248 |
10 | 2013312311 |
11 | 94350a37a |
12 | 48230735b |
13 | 26115877a |
14 | 151562583 |
15 | bbb41eab |
hex | 7800b537 |
2013312311 has 4 divisors (see below), whose sum is σ = 2016838824. Its totient is φ = 2009785800.
The previous prime is 2013312293. The next prime is 2013312341. The reversal of 2013312311 is 1132133102.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1132133102 = 2 ⋅566066551.
It is a cyclic number.
It is not a de Polignac number, because 2013312311 - 214 = 2013295927 is a prime.
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 2013312311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2013312341) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1762400 + ... + 1763541.
It is an arithmetic number, because the mean of its divisors is an integer number (504209706).
Almost surely, 22013312311 is an apocalyptic number.
2013312311 is a deficient number, since it is larger than the sum of its proper divisors (3526513).
2013312311 is an equidigital number, since it uses as much as digits as its factorization.
2013312311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3526512.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 2013312311 is about 44869.9488633540. The cubic root of 2013312311 is about 1262.7102806423.
Adding to 2013312311 its reverse (1132133102), we get a palindrome (3145445413).
The spelling of 2013312311 in words is "two billion, thirteen million, three hundred twelve thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •