Base | Representation |
---|---|
bin | 11110101110111101101… |
… | …011110110000111101111 |
3 | 21110220110200220222110000 |
4 | 132232331223312013233 |
5 | 234100344400030111 |
6 | 4254124500315343 |
7 | 305405416046331 |
oct | 36567553660757 |
9 | 7426420828400 |
10 | 2112011330031 |
11 | 744776376a19 |
12 | 2a13a43a2b53 |
13 | 124214674695 |
14 | 74316c3b451 |
15 | 39e11974c56 |
hex | 1ebbdaf61ef |
2112011330031 has 20 divisors (see below), whose sum is σ = 3165256732792. Its totient is φ = 1403421193008.
The previous prime is 2112011330017. The next prime is 2112011330059. The reversal of 2112011330031 is 1300331102112.
It is not a de Polignac number, because 2112011330031 - 25 = 2112011329999 is a prime.
It is a super-2 number, since 2×21120113300312 (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 = 2112011329986 and 2112011330013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2112011330431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 42441280 + ... + 42491013.
Almost surely, 22112011330031 is an apocalyptic number.
2112011330031 is a deficient number, since it is larger than the sum of its proper divisors (1053245402761).
2112011330031 is an equidigital number, since it uses as much as digits as its factorization.
2112011330031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84932612 (or 84932603 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 2112011330031 its reverse (1300331102112), we get a palindrome (3412342432143).
The spelling of 2112011330031 in words is "two trillion, one hundred twelve billion, eleven million, three hundred thirty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •