Base | Representation |
---|---|
bin | 101101010001101101111… |
… | …001001001110101000001 |
3 | 102000110001211001201000102 |
4 | 231101231321021311001 |
5 | 401434121401140223 |
6 | 10341205112332145 |
7 | 440535251546243 |
oct | 55215571116501 |
9 | 12013054051012 |
10 | 3111400021313 |
11 | a9a5a021a5a1 |
12 | 4230156a4055 |
13 | 1975330b518c |
14 | aa841dd6093 |
15 | 55e046d7928 |
hex | 2d46de49d41 |
3111400021313 has 8 divisors (see below), whose sum is σ = 3211838612736. Its totient is φ = 3010965858000.
The previous prime is 3111400021267. The next prime is 3111400021351. The reversal of 3111400021313 is 3131200041113.
3111400021313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3111400021313 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3111400027313) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 351470 + ... + 2519192.
It is an arithmetic number, because the mean of its divisors is an integer number (401479826592).
Almost surely, 23111400021313 is an apocalyptic number.
It is an amenable number.
3111400021313 is a deficient number, since it is larger than the sum of its proper divisors (100438591423).
3111400021313 is a wasteful number, since it uses less digits than its factorization.
3111400021313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2214055.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 3111400021313 its reverse (3131200041113), we get a palindrome (6242600062426).
The spelling of 3111400021313 in words is "three trillion, one hundred eleven billion, four hundred million, twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •