Base | Representation |
---|---|
bin | 11110101110000001011… |
… | …111011001010000101011 |
3 | 21110210212022121220100010 |
4 | 132232001133121100223 |
5 | 234041312331330011 |
6 | 4253440342543003 |
7 | 305341404055443 |
oct | 36560137312053 |
9 | 7423768556303 |
10 | 2111001433131 |
11 | 7442a8303488 |
12 | 2a1162137a63 |
13 | 1240b3380856 |
14 | 7425ca75123 |
15 | 39da2e8b1a6 |
hex | 1eb817d942b |
2111001433131 has 8 divisors (see below), whose sum is σ = 2860810685584. Its totient is φ = 1384263234720.
The previous prime is 2111001433111. The next prime is 2111001433133. The reversal of 2111001433131 is 1313341001112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2111001433131 - 26 = 2111001433067 is a prime.
It is a super-2 number, since 2×21110014331312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2111001433098 and 2111001433107.
It is not an unprimeable number, because it can be changed into a prime (2111001433133) 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, 5767763296 + ... + 5767763661.
It is an arithmetic number, because the mean of its divisors is an integer number (357601335698).
Almost surely, 22111001433131 is an apocalyptic number.
2111001433131 is a deficient number, since it is larger than the sum of its proper divisors (749809252453).
2111001433131 is a wasteful number, since it uses less digits than its factorization.
2111001433131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11535527021.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 2111001433131 its reverse (1313341001112), we get a palindrome (3424342434243).
The spelling of 2111001433131 in words is "two trillion, one hundred eleven billion, one million, four hundred thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •