Base | Representation |
---|---|
bin | 1010000110101011111111… |
… | …10011011011100110001110 |
3 | 2220200012201200221220220120 |
4 | 11003111333303123212032 |
5 | 10403023040030323042 |
6 | 115131422013125410 |
7 | 4452225363534345 |
oct | 503257763334616 |
9 | 86605650856816 |
10 | 22220010011022 |
11 | 70974a941650a |
12 | 25aa478489866 |
13 | c52451638785 |
14 | 56b65055cb5c |
15 | 287ed7d7edec |
hex | 14357fcdb98e |
22220010011022 has 8 divisors (see below), whose sum is σ = 44440020022056. Its totient is φ = 7406670003672.
The previous prime is 22220010010981. The next prime is 22220010011047. The reversal of 22220010011022 is 22011001002222.
It is a sphenic number, since it is the product of 3 distinct primes.
22220010011022 is an admirable number.
It is a super-2 number, since 2×222200100110222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22220010010992 and 22220010011010.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1851667500913 + ... + 1851667500924.
It is an arithmetic number, because the mean of its divisors is an integer number (5555002502757).
Almost surely, 222220010011022 is an apocalyptic number.
22220010011022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22220010011022 is a wasteful number, since it uses less digits than its factorization.
22220010011022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3703335001842.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 22220010011022 its reverse (22011001002222), we get a palindrome (44231011013244).
The spelling of 22220010011022 in words is "twenty-two trillion, two hundred twenty billion, ten million, eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •