Base | Representation |
---|---|
bin | 10000010101001001100… |
… | …101110000111111001001 |
3 | 10222021122111222122202112 |
4 | 100111021211300333021 |
5 | 121341302100213001 |
6 | 2215312524512105 |
7 | 144035453653400 |
oct | 20251145607711 |
9 | 3867574878675 |
10 | 1122221101001 |
11 | 3a2a27612080 |
12 | 1615b16ab635 |
13 | 81a95691b50 |
14 | 3c45c760637 |
15 | 1e2d1705cbb |
hex | 10549970fc9 |
1122221101001 has 48 divisors (see below), whose sum is σ = 1534123463040. Its totient is φ = 806950609920.
The previous prime is 1122221100967. The next prime is 1122221101003. The reversal of 1122221101001 is 1001011222211.
It is not a de Polignac number, because 1122221101001 - 230 = 1121147359177 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1122221101003) 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 47 ways as a sum of consecutive naturals, for example, 25322180 + ... + 25366458.
It is an arithmetic number, because the mean of its divisors is an integer number (31960905480).
Almost surely, 21122221101001 is an apocalyptic number.
1122221101001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1122221101001 is a deficient number, since it is larger than the sum of its proper divisors (411902362039).
1122221101001 is a wasteful number, since it uses less digits than its factorization.
1122221101001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47934 (or 47927 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1122221101001 its reverse (1001011222211), we get a palindrome (2123232323212).
The spelling of 1122221101001 in words is "one trillion, one hundred twenty-two billion, two hundred twenty-one million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •