Base | Representation |
---|---|
bin | 101101010001010111011… |
… | …011011011010110010001 |
3 | 102000102002112212122022221 |
4 | 231101113123123112101 |
5 | 401432333410130001 |
6 | 10341103450301041 |
7 | 440523024201613 |
oct | 55212733332621 |
9 | 12012075778287 |
10 | 3111023130001 |
11 | a9a4174a8576 |
12 | 422b2b427781 |
13 | 1974a2ca4c77 |
14 | aa807d28db3 |
15 | 55dd158b1a1 |
hex | 2d4576db591 |
3111023130001 has 4 divisors (see below), whose sum is σ = 3113367534592. Its totient is φ = 3108678725412.
The previous prime is 3111023129953. The next prime is 3111023130011. The reversal of 3111023130001 is 1000313201113.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 3111023130001 - 215 = 3111023097233 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3111023130011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1172200305 + ... + 1172202958.
It is an arithmetic number, because the mean of its divisors is an integer number (778341883648).
Almost surely, 23111023130001 is an apocalyptic number.
It is an amenable number.
3111023130001 is a deficient number, since it is larger than the sum of its proper divisors (2344404591).
3111023130001 is a wasteful number, since it uses less digits than its factorization.
3111023130001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2344404590.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 3111023130001 its reverse (1000313201113), we get a palindrome (4111336331114).
The spelling of 3111023130001 in words is "three trillion, one hundred eleven billion, twenty-three million, one hundred thirty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •