Base | Representation |
---|---|
bin | 10000010101001010001… |
… | …100010111101100001001 |
3 | 10222021200020000210210100 |
4 | 100111022030113230021 |
5 | 121341312143033001 |
6 | 2215313525440013 |
7 | 144035635662642 |
oct | 20251214275411 |
9 | 3867606023710 |
10 | 1122231221001 |
11 | 3a2a322a4410 |
12 | 1615b4b70009 |
13 | 81a977c6207 |
14 | 3c45dc366c9 |
15 | 1e2d2554586 |
hex | 1054a317b09 |
1122231221001 has 12 divisors (see below), whose sum is σ = 1768364348400. Its totient is φ = 680140133880.
The previous prime is 1122231220997. The next prime is 1122231221047. The reversal of 1122231221001 is 1001221322211.
It is not a de Polignac number, because 1122231221001 - 22 = 1122231220997 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1122231221401) 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 11 ways as a sum of consecutive naturals, for example, 5667834351 + ... + 5667834548.
It is an arithmetic number, because the mean of its divisors is an integer number (147363695700).
Almost surely, 21122231221001 is an apocalyptic number.
1122231221001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1122231221001 is a deficient number, since it is larger than the sum of its proper divisors (646133127399).
1122231221001 is a wasteful number, since it uses less digits than its factorization.
1122231221001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11335668916 (or 11335668913 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 1122231221001 its reverse (1001221322211), we get a palindrome (2123452543212).
The spelling of 1122231221001 in words is "one trillion, one hundred twenty-two billion, two hundred thirty-one million, two hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •