Base | Representation |
---|---|
bin | 10000010100001110000… |
… | …111011101011111101111 |
3 | 10222012001222110011121202 |
4 | 100110032013131133233 |
5 | 121332231131113403 |
6 | 2215025522320115 |
7 | 144001646544653 |
oct | 20241607353757 |
9 | 3865058404552 |
10 | 1121223301103 |
11 | 3a2565361264 |
12 | 1613734b903b |
13 | 81966a451c9 |
14 | 3c3a6026a63 |
15 | 1e273d0b688 |
hex | 1050e1dd7ef |
1121223301103 has 8 divisors (see below), whose sum is σ = 1159942197456. Its totient is φ = 1083045928000.
The previous prime is 1121223301069. The next prime is 1121223301111. The reversal of 1121223301103 is 3011033221211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1121223301103 - 218 = 1121223038959 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 (1121223303103) 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 7 ways as a sum of consecutive naturals, for example, 135376601 + ... + 135384882.
It is an arithmetic number, because the mean of its divisors is an integer number (144992774682).
Almost surely, 21121223301103 is an apocalyptic number.
1121223301103 is a deficient number, since it is larger than the sum of its proper divisors (38718896353).
1121223301103 is a wasteful number, since it uses less digits than its factorization.
1121223301103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 270761625.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1121223301103 its reverse (3011033221211), we get a palindrome (4132256522314).
The spelling of 1121223301103 in words is "one trillion, one hundred twenty-one billion, two hundred twenty-three million, three hundred one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •