Base | Representation |
---|---|
bin | 1010000011010010010010… |
… | …10001110011101101001011 |
3 | 2220021001001012200120121200 |
4 | 11001221021101303231023 |
5 | 10344114203031011334 |
6 | 115002012132435243 |
7 | 4440620123344455 |
oct | 501511121635513 |
9 | 86231035616550 |
10 | 22103131110219 |
11 | 7051981314415 |
12 | 258b899a78b23 |
13 | c44415c55c83 |
14 | 565b239432d5 |
15 | 284e46dde799 |
hex | 141a49473b4b |
22103131110219 has 24 divisors (see below), whose sum is σ = 32526470076672. Its totient is φ = 14460297009840.
The previous prime is 22103131110139. The next prime is 22103131110251. The reversal of 22103131110219 is 91201113130122.
22103131110219 is a `hidden beast` number, since 2 + 21 + 0 + 313 + 1 + 110 + 219 = 666.
It is not a de Polignac number, because 22103131110219 - 29 = 22103131109707 is a prime.
It is a super-2 number, since 2×221031311102192 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22103131110192 and 22103131110201.
It is not an unprimeable number, because it can be changed into a prime (22103131112219) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 69528247 + ... + 69845424.
It is an arithmetic number, because the mean of its divisors is an integer number (1355269586528).
Almost surely, 222103131110219 is an apocalyptic number.
22103131110219 is a deficient number, since it is larger than the sum of its proper divisors (10423338966453).
22103131110219 is a wasteful number, since it uses less digits than its factorization.
22103131110219 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139374007 (or 139374004 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 27.
The spelling of 22103131110219 in words is "twenty-two trillion, one hundred three billion, one hundred thirty-one million, one hundred ten thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •