Base | Representation |
---|---|
bin | 10000010100010011011… |
… | …010101101011000101011 |
3 | 10222012022011210101020211 |
4 | 100110103122231120223 |
5 | 121332421412424003 |
6 | 2215042420401551 |
7 | 144004106501434 |
oct | 20242332553053 |
9 | 3865264711224 |
10 | 1121312233003 |
11 | 3a26005830a6 |
12 | 1613992462b7 |
13 | 8197c2b1c31 |
14 | 3c3b3b7648b |
15 | 1e27ba2696d |
hex | 105136ad62b |
1121312233003 has 4 divisors (see below), whose sum is σ = 1128026677680. Its totient is φ = 1114597788328.
The previous prime is 1121312232991. The next prime is 1121312233007. The reversal of 1121312233003 is 3003322131211.
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 1121312233003 - 221 = 1121310135851 is a prime.
It is a super-2 number, since 2×11213122330032 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1121312233007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3357222088 + ... + 3357222421.
It is an arithmetic number, because the mean of its divisors is an integer number (282006669420).
Almost surely, 21121312233003 is an apocalyptic number.
1121312233003 is a deficient number, since it is larger than the sum of its proper divisors (6714444677).
1121312233003 is an equidigital number, since it uses as much as digits as its factorization.
1121312233003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6714444676.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 1121312233003 its reverse (3003322131211), we get a palindrome (4124634364214).
The spelling of 1121312233003 in words is "one trillion, one hundred twenty-one billion, three hundred twelve million, two hundred thirty-three thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •