Base | Representation |
---|---|
bin | 1010000100001000010010… |
… | …10010110110101111011011 |
3 | 2220100210212122221101222011 |
4 | 11002010021102312233123 |
5 | 10400103041314222133 |
6 | 115023205013010351 |
7 | 4442664424353235 |
oct | 502041122665733 |
9 | 86323778841864 |
10 | 22132122414043 |
11 | 70631a9135044 |
12 | 259542b0239b7 |
13 | c47086357915 |
14 | 5672b4019255 |
15 | 285a921ba6cd |
hex | 1421094b6bdb |
22132122414043 has 4 divisors (see below), whose sum is σ = 22895299049040. Its totient is φ = 21368945779048.
The previous prime is 22132122414029. The next prime is 22132122414079. The reversal of 22132122414043 is 34041422123122.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22132122414043 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22132122413996 and 22132122414014.
It is not an unprimeable number, because it can be changed into a prime (22132122444043) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 381588317455 + ... + 381588317512.
It is an arithmetic number, because the mean of its divisors is an integer number (5723824762260).
Almost surely, 222132122414043 is an apocalyptic number.
22132122414043 is a deficient number, since it is larger than the sum of its proper divisors (763176634997).
22132122414043 is an equidigital number, since it uses as much as digits as its factorization.
22132122414043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 763176634996.
The product of its (nonzero) digits is 18432, while the sum is 31.
Adding to 22132122414043 its reverse (34041422123122), we get a palindrome (56173544537165).
The spelling of 22132122414043 in words is "twenty-two trillion, one hundred thirty-two billion, one hundred twenty-two million, four hundred fourteen thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •