Base | Representation |
---|---|
bin | 1010000100000110111101… |
… | …11010100110100010000010 |
3 | 2220100202001010001211001201 |
4 | 11002003132322212202002 |
5 | 10400100112310204442 |
6 | 115023010253451414 |
7 | 4442641002063244 |
oct | 502033672464202 |
9 | 86322033054051 |
10 | 22131411413122 |
11 | 7062973861580 |
12 | 2595270aa0b6a |
13 | c46ca1c6620b |
14 | 56724781a094 |
15 | 285a4ea737b7 |
hex | 1420deea6882 |
22131411413122 has 32 divisors (see below), whose sum is σ = 36291369600000. Its totient is φ = 10038533106000.
The previous prime is 22131411413099. The next prime is 22131411413123.
22131411413122 is nontrivially palindromic in base 10.
It is a super-2 number, since 2×221314114131222 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (22131411413123) 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 15 ways as a sum of consecutive naturals, for example, 111338379 + ... + 111536977.
It is an arithmetic number, because the mean of its divisors is an integer number (1134105300000).
Almost surely, 222131411413122 is an apocalyptic number.
22131411413122 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
22131411413122 is a deficient number, since it is larger than the sum of its proper divisors (14159958186878).
22131411413122 is a wasteful number, since it uses less digits than its factorization.
22131411413122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 209262.
The product of its digits is 2304, while the sum is 28.
It can be divided in two parts, 2213141 and 1413122, that added together give a palindrome (3626263).
The spelling of 22131411413122 in words is "twenty-two trillion, one hundred thirty-one billion, four hundred eleven million, four hundred thirteen thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •