Base | Representation |
---|---|
bin | 1010000000111011100110… |
… | …01110000111000001110000 |
3 | 2212222022020002201221122202 |
4 | 11000131303032013001300 |
5 | 10341303011440431412 |
6 | 114500512321522332 |
7 | 4432024253610011 |
oct | 500356316070160 |
9 | 85868202657582 |
10 | 22022230405232 |
11 | 7020636a44352 |
12 | 25780804a33a8 |
13 | c398c233b935 |
14 | 561c4b307008 |
15 | 282cae8053c2 |
hex | 140773387070 |
22022230405232 has 20 divisors (see below), whose sum is σ = 42668204926920. Its totient is φ = 11011080746688.
The previous prime is 22022230405223. The next prime is 22022230405289. The reversal of 22022230405232 is 23250403222022.
It is a super-2 number, since 2×220222304052322 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22022230405195 and 22022230405204.
It is a congruent number.
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, 3582383 + ... + 7541745.
It is an arithmetic number, because the mean of its divisors is an integer number (2133410246346).
Almost surely, 222022230405232 is an apocalyptic number.
It is an amenable number.
22022230405232 is a deficient number, since it is larger than the sum of its proper divisors (20645974521688).
22022230405232 is a wasteful number, since it uses less digits than its factorization.
22022230405232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4307000 (or 4306994 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 29.
Adding to 22022230405232 its reverse (23250403222022), we get a palindrome (45272633627254).
The spelling of 22022230405232 in words is "twenty-two trillion, twenty-two billion, two hundred thirty million, four hundred five thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •