Base | Representation |
---|---|
bin | 10000010011010011110… |
… | …000100100100101101001 |
3 | 10222002112202010211000100 |
4 | 100103103300210211221 |
5 | 121323230010103223 |
6 | 2214344425300013 |
7 | 143635460530566 |
oct | 20232360444551 |
9 | 3862482124010 |
10 | 1120244222313 |
11 | 3a2102727937 |
12 | 16113b634609 |
13 | 8183bc51848 |
14 | 3c311da386d |
15 | 1e217dae043 |
hex | 104d3c24969 |
1120244222313 has 24 divisors (see below), whose sum is σ = 1703761768800. Its totient is φ = 707328906624.
The previous prime is 1120244222299. The next prime is 1120244222341. The reversal of 1120244222313 is 3132224420211.
1120244222313 is a `hidden beast` number, since 1 + 1 + 2 + 0 + 2 + 4 + 422 + 231 + 3 = 666.
It is not a de Polignac number, because 1120244222313 - 210 = 1120244221289 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1120244222113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 269520 + ... + 1520897.
It is an arithmetic number, because the mean of its divisors is an integer number (70990073700).
Almost surely, 21120244222313 is an apocalyptic number.
It is an amenable number.
1120244222313 is a deficient number, since it is larger than the sum of its proper divisors (583517546487).
1120244222313 is a wasteful number, since it uses less digits than its factorization.
1120244222313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1794101 (or 1794098 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 1120244222313 its reverse (3132224420211), we get a palindrome (4252468642524).
The spelling of 1120244222313 in words is "one trillion, one hundred twenty billion, two hundred forty-four million, two hundred twenty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •