Base | Representation |
---|---|
bin | 11110100100110101001… |
… | …011111100111011010011 |
3 | 21102212101110021212210021 |
4 | 132210311023330323103 |
5 | 233411104110131311 |
6 | 4245125120244311 |
7 | 304541664440332 |
oct | 36446513747323 |
9 | 7385343255707 |
10 | 2101131333331 |
11 | 7400a2952408 |
12 | 29b268770697 |
13 | 12319c575604 |
14 | 739a3c87d19 |
15 | 399c66dc171 |
hex | 1e9352fced3 |
2101131333331 has 32 divisors (see below), whose sum is σ = 2319051409920. Its totient is φ = 1896744326400.
The previous prime is 2101131333283. The next prime is 2101131333373. The reversal of 2101131333331 is 1333331311012.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2101131333331 is a prime.
It is a super-2 number, since 2×21011313333312 (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 = 2101131333296 and 2101131333305.
It is not an unprimeable number, because it can be changed into a prime (2101131333731) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5740545 + ... + 6095581.
It is an arithmetic number, because the mean of its divisors is an integer number (72470356560).
Almost surely, 22101131333331 is an apocalyptic number.
2101131333331 is a deficient number, since it is larger than the sum of its proper divisors (217920076589).
2101131333331 is a wasteful number, since it uses less digits than its factorization.
2101131333331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 355275.
The product of its (nonzero) digits is 1458, while the sum is 25.
Adding to 2101131333331 its reverse (1333331311012), we get a palindrome (3434462644343).
The spelling of 2101131333331 in words is "two trillion, one hundred one billion, one hundred thirty-one million, three hundred thirty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •