Base | Representation |
---|---|
bin | 11110101111001010010… |
… | …000101101011010111001 |
3 | 21110221000101221101200220 |
4 | 132233022100231122321 |
5 | 234101312403222223 |
6 | 4254201434450253 |
7 | 305413560326340 |
oct | 36571220553271 |
9 | 7427011841626 |
10 | 2112222320313 |
11 | 744874486056 |
12 | 2a1442b93989 |
13 | 1242492a91c1 |
14 | 74336c80b57 |
15 | 39e252506e3 |
hex | 1ebca42d6b9 |
2112222320313 has 16 divisors (see below), whose sum is σ = 3225792931200. Its totient is φ = 1204296016896.
The previous prime is 2112222320297. The next prime is 2112222320317. The reversal of 2112222320313 is 3130232222112.
It is not a de Polignac number, because 2112222320313 - 24 = 2112222320297 is a prime.
It is a super-2 number, since 2×21122223203132 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2112222320317) 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 15 ways as a sum of consecutive naturals, for example, 111997270 + ... + 112016127.
It is an arithmetic number, because the mean of its divisors is an integer number (201612058200).
Almost surely, 22112222320313 is an apocalyptic number.
It is an amenable number.
2112222320313 is a deficient number, since it is larger than the sum of its proper divisors (1113570610887).
2112222320313 is a wasteful number, since it uses less digits than its factorization.
2112222320313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 224013856.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 2112222320313 its reverse (3130232222112), we get a palindrome (5242454542425).
The spelling of 2112222320313 in words is "two trillion, one hundred twelve billion, two hundred twenty-two million, three hundred twenty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •