Base | Representation |
---|---|
bin | 10000010101010000110… |
… | …100100110110111010011 |
3 | 10222021221222021220220001 |
4 | 100111100310212313103 |
5 | 121342024130312321 |
6 | 2215332541230431 |
7 | 144041456160610 |
oct | 20252064466723 |
9 | 3867858256801 |
10 | 1122342432211 |
11 | 3a2a8a053000 |
12 | 161626262417 |
13 | 81ab4863970 |
14 | 3c470905507 |
15 | 1e2dc1c0c91 |
hex | 10550d26dd3 |
1122342432211 has 32 divisors (see below), whose sum is σ = 1519375366656. Its totient is φ = 807279184800.
The previous prime is 1122342432179. The next prime is 1122342432221.
1122342432211 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 1122342432211 - 25 = 1122342432179 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1122342432211.
It is not an unprimeable number, because it can be changed into a prime (1122342432221) 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 31 ways as a sum of consecutive naturals, for example, 4512025 + ... + 4754266.
It is an arithmetic number, because the mean of its divisors is an integer number (47480480208).
Almost surely, 21122342432211 is an apocalyptic number.
1122342432211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1122342432211 is a deficient number, since it is larger than the sum of its proper divisors (397032934445).
1122342432211 is an equidigital number, since it uses as much as digits as its factorization.
1122342432211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9266344 (or 9266322 counting only the distinct ones).
The product of its digits is 4608, while the sum is 28.
The spelling of 1122342432211 in words is "one trillion, one hundred twenty-two billion, three hundred forty-two million, four hundred thirty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •