Base | Representation |
---|---|
bin | 101101010001100111111… |
… | …100011000100111110001 |
3 | 102000102210212020111211110 |
4 | 231101213330120213301 |
5 | 401433420323030131 |
6 | 10341151145103533 |
7 | 440532630250560 |
oct | 55214774304761 |
9 | 12012725214743 |
10 | 3111300205041 |
11 | a9a549944106 |
12 | 422ba8187ba9 |
13 | 1975185071b2 |
14 | aa832a51bd7 |
15 | 55deaa6c646 |
hex | 2d467f189f1 |
3111300205041 has 32 divisors (see below), whose sum is σ = 4845569200128. Its totient is φ = 1738740516480.
The previous prime is 3111300205019. The next prime is 3111300205073. The reversal of 3111300205041 is 1405020031113.
It is not a de Polignac number, because 3111300205041 - 211 = 3111300202993 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 3111300204999 and 3111300205017.
It is not an unprimeable number, because it can be changed into a prime (3111300205001) 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 31 ways as a sum of consecutive naturals, for example, 110686 + ... + 2496968.
It is an arithmetic number, because the mean of its divisors is an integer number (151424037504).
Almost surely, 23111300205041 is an apocalyptic number.
It is an amenable number.
3111300205041 is a deficient number, since it is larger than the sum of its proper divisors (1734268995087).
3111300205041 is a wasteful number, since it uses less digits than its factorization.
3111300205041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2387661.
The product of its (nonzero) digits is 360, while the sum is 21.
Adding to 3111300205041 its reverse (1405020031113), we get a palindrome (4516320236154).
The spelling of 3111300205041 in words is "three trillion, one hundred eleven billion, three hundred million, two hundred five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.138 sec. • engine limits •