Base | Representation |
---|---|
bin | 11110101110001000000… |
… | …010100111110011000101 |
3 | 21110211010222102021220001 |
4 | 132232020002213303011 |
5 | 234042024000043023 |
6 | 4253455310241301 |
7 | 305344210143436 |
oct | 36561002476305 |
9 | 7424128367801 |
10 | 2111111331013 |
11 | 744354345383 |
12 | 2a1192ab6231 |
13 | 12410007b599 |
14 | 7426d4c148d |
15 | 39dac9486ad |
hex | 1eb880a7cc5 |
2111111331013 has 8 divisors (see below), whose sum is σ = 2111620328856. Its totient is φ = 2110602412800.
The previous prime is 2111111331001. The next prime is 2111111331019. The reversal of 2111111331013 is 3101331111112.
It can be written as a sum of positive squares in 4 ways, for example, as 84112760484 + 2026998570529 = 290022^2 + 1423727^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2111111331013 - 213 = 2111111322821 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2111111331019) 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, 115094223 + ... + 115112563.
It is an arithmetic number, because the mean of its divisors is an integer number (263952541107).
Almost surely, 22111111331013 is an apocalyptic number.
It is an amenable number.
2111111331013 is a deficient number, since it is larger than the sum of its proper divisors (508997843).
2111111331013 is a wasteful number, since it uses less digits than its factorization.
2111111331013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39815.
The product of its (nonzero) digits is 54, while the sum is 19.
Adding to 2111111331013 its reverse (3101331111112), we get a palindrome (5212442442125).
The spelling of 2111111331013 in words is "two trillion, one hundred eleven billion, one hundred eleven million, three hundred thirty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •