Base | Representation |
---|---|
bin | 11110101110000011111… |
… | …110110110101000001001 |
3 | 21110210222020021121210001 |
4 | 132232003332312220021 |
5 | 234041404031444223 |
6 | 4253444434523001 |
7 | 305342422264666 |
oct | 36560376665011 |
9 | 7423866247701 |
10 | 2111043234313 |
11 | 744319964312 |
12 | 2a1174136461 |
13 | 1240bbc28190 |
14 | 74264436a6d |
15 | 39da69969ad |
hex | 1eb83fb6a09 |
2111043234313 has 32 divisors (see below), whose sum is σ = 2388193458336. Its totient is φ = 1852971614208.
The previous prime is 2111043234299. The next prime is 2111043234329. The reversal of 2111043234313 is 3134323401112.
It can be written as a sum of positive squares in 16 ways, for example, as 11288637504 + 2099754596809 = 106248^2 + 1449053^2 .
It is a de Polignac number, because none of the positive numbers 2k-2111043234313 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2111043235313) 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, 6390595 + ... + 6712807.
It is an arithmetic number, because the mean of its divisors is an integer number (74631045573).
Almost surely, 22111043234313 is an apocalyptic number.
It is an amenable number.
2111043234313 is a deficient number, since it is larger than the sum of its proper divisors (277150224023).
2111043234313 is a wasteful number, since it uses less digits than its factorization.
2111043234313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 322573.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 2111043234313 its reverse (3134323401112), we get a palindrome (5245366635425).
The spelling of 2111043234313 in words is "two trillion, one hundred eleven billion, forty-three million, two hundred thirty-four thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •