Base | Representation |
---|---|
bin | 1010001100100100101101… |
… | …11010111010001010101110 |
3 | 2221101112202221110110012021 |
4 | 11012102112322322022232 |
5 | 10414331242343411001 |
6 | 115404351124300354 |
7 | 4502645352315526 |
oct | 506222672721256 |
9 | 87345687413167 |
10 | 22422261310126 |
11 | 7165255a64a87 |
12 | 2621701b416ba |
13 | c685441aaaa2 |
14 | 577359632686 |
15 | 28d3c3ca5ba1 |
hex | 146496eba2ae |
22422261310126 has 8 divisors (see below), whose sum is σ = 33633701192304. Its totient is φ = 11211027579360.
The previous prime is 22422261310093. The next prime is 22422261310147. The reversal of 22422261310126 is 62101316222422.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×224222613101263 (a number of 41 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22422261310091 and 22422261310100.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 51265650 + ... + 51701173.
It is an arithmetic number, because the mean of its divisors is an integer number (4204212649038).
Almost surely, 222422261310126 is an apocalyptic number.
22422261310126 is a deficient number, since it is larger than the sum of its proper divisors (11211439882178).
22422261310126 is a wasteful number, since it uses less digits than its factorization.
22422261310126 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103075706.
The product of its (nonzero) digits is 27648, while the sum is 34.
Adding to 22422261310126 its reverse (62101316222422), we get a palindrome (84523577532548).
The spelling of 22422261310126 in words is "twenty-two trillion, four hundred twenty-two billion, two hundred sixty-one million, three hundred ten thousand, one hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •