Base | Representation |
---|---|
bin | 1010000110001010111001… |
… | …10101001100000111000010 |
3 | 2220121111212111221120112221 |
4 | 11003011130311030013002 |
5 | 10402230143302301010 |
6 | 115115323025041254 |
7 | 4451026201042063 |
oct | 503053465140702 |
9 | 86544774846487 |
10 | 22202243400130 |
11 | 708aa11651812 |
12 | 25a6b3a48622a |
13 | c5087c882c71 |
14 | 56a846b2656a |
15 | 2877e8228dda |
hex | 14315cd4c1c2 |
22202243400130 has 8 divisors (see below), whose sum is σ = 39964038120252. Its totient is φ = 8880897360048.
The previous prime is 22202243400121. The next prime is 22202243400179. The reversal of 22202243400130 is 3100434220222.
It can be written as a sum of positive squares in 2 ways, for example, as 20252961108241 + 1949282291889 = 4500329^2 + 1396167^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×222022434001302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22202243400095 and 22202243400104.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 1110112169997 + ... + 1110112170016.
Almost surely, 222202243400130 is an apocalyptic number.
22202243400130 is a deficient number, since it is larger than the sum of its proper divisors (17761794720122).
22202243400130 is a wasteful number, since it uses less digits than its factorization.
22202243400130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2220224340020.
The product of its (nonzero) digits is 4608, while the sum is 25.
Adding to 22202243400130 its reverse (3100434220222), we get a palindrome (25302677620352).
The spelling of 22202243400130 in words is "twenty-two trillion, two hundred two billion, two hundred forty-three million, four hundred thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.385 sec. • engine limits •