Base | Representation |
---|---|
bin | 10000010100000001011… |
… | …110011100101100000111 |
3 | 10222011112012101111120102 |
4 | 100110001132130230013 |
5 | 121331312333121203 |
6 | 2214552504554315 |
7 | 143663463115226 |
oct | 20240136345407 |
9 | 3864465344512 |
10 | 1121011223303 |
11 | 3a246667a054 |
12 | 16131448299b |
13 | 81931b1c69a |
14 | 3c385bbccbd |
15 | 1e2603b8888 |
hex | 1050179cb07 |
1121011223303 has 4 divisors (see below), whose sum is σ = 1121541756048. Its totient is φ = 1120480690560.
The previous prime is 1121011223287. The next prime is 1121011223329. The reversal of 1121011223303 is 3033221101211.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1121011223303 - 24 = 1121011223287 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121011223503) 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 3 ways as a sum of consecutive naturals, for example, 265263203 + ... + 265267428.
It is an arithmetic number, because the mean of its divisors is an integer number (280385439012).
Almost surely, 21121011223303 is an apocalyptic number.
1121011223303 is a deficient number, since it is larger than the sum of its proper divisors (530532745).
1121011223303 is an equidigital number, since it uses as much as digits as its factorization.
1121011223303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 530532744.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1121011223303 its reverse (3033221101211), we get a palindrome (4154232324514).
The spelling of 1121011223303 in words is "one trillion, one hundred twenty-one billion, eleven million, two hundred twenty-three thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •