Base | Representation |
---|---|
bin | 11101100011101110010… |
… | …001000011010011101111 |
3 | 21012011221100120100110021 |
4 | 131203232101003103233 |
5 | 231234420313323434 |
6 | 4153044105023011 |
7 | 266515401135400 |
oct | 35435621032357 |
9 | 7164840510407 |
10 | 2031222011119 |
11 | 713488964964 |
12 | 2897b8184a67 |
13 | 11970ab59572 |
14 | 704513179a7 |
15 | 37c8403dcb4 |
hex | 1d8ee4434ef |
2031222011119 has 12 divisors (see below), whose sum is σ = 2363199035400. Its totient is φ = 1740790323888.
The previous prime is 2031222011113. The next prime is 2031222011123. The reversal of 2031222011119 is 9111102221302.
It is not a de Polignac number, because 2031222011119 - 29 = 2031222010607 is a prime.
It is a super-2 number, since 2×20312220111192 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2031222011093 and 2031222011102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2031222011113) 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 11 ways as a sum of consecutive naturals, for example, 2725324 + ... + 3389665.
It is an arithmetic number, because the mean of its divisors is an integer number (196933252950).
Almost surely, 22031222011119 is an apocalyptic number.
2031222011119 is a deficient number, since it is larger than the sum of its proper divisors (331977024281).
2031222011119 is an equidigital number, since it uses as much as digits as its factorization.
2031222011119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6121782 (or 6121775 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 25.
The spelling of 2031222011119 in words is "two trillion, thirty-one billion, two hundred twenty-two million, eleven thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •