Base | Representation |
---|---|
bin | 1010000100000100011001… |
… | …10001100011101000001110 |
3 | 2220100121111001220221021120 |
4 | 11002002030301203220032 |
5 | 10400034302011411342 |
6 | 115022221424141410 |
7 | 4442561566310445 |
oct | 502021461435016 |
9 | 86317431827246 |
10 | 22130033310222 |
11 | 7062326969462 |
12 | 2594b47467866 |
13 | c46b125b3506 |
14 | 5671567a7d5c |
15 | 2859bdaa6aec |
hex | 14208cc63a0e |
22130033310222 has 32 divisors (see below), whose sum is σ = 46257609945600. Its totient is φ = 7044770446560.
The previous prime is 22130033310181. The next prime is 22130033310223. The reversal of 22130033310222 is 22201333003122.
It is a junction number, because it is equal to n+sod(n) for n = 22130033310192 and 22130033310201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22130033310223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 126983097 + ... + 127157252.
It is an arithmetic number, because the mean of its divisors is an integer number (1445550310800).
Almost surely, 222130033310222 is an apocalyptic number.
22130033310222 is an abundant number, since it is smaller than the sum of its proper divisors (24127576635378).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22130033310222 is a wasteful number, since it uses less digits than its factorization.
22130033310222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 254141008.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 22130033310222 its reverse (22201333003122), we get a palindrome (44331366313344).
The spelling of 22130033310222 in words is "twenty-two trillion, one hundred thirty billion, thirty-three million, three hundred ten thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •