Base | Representation |
---|---|
bin | 1010001100000010110001… |
… | …11110010011001001111100 |
3 | 2221022210202012212211110220 |
4 | 11012001120332103021330 |
5 | 10414031434242023312 |
6 | 115352135212301340 |
7 | 4501432023044334 |
oct | 506013076231174 |
9 | 87283665784426 |
10 | 22404042142332 |
11 | 7158556798614 |
12 | 261a078471850 |
13 | c668cc741826 |
14 | 57650ba740c4 |
15 | 28cba9558c8c |
hex | 146058f9327c |
22404042142332 has 48 divisors (see below), whose sum is σ = 54152823261600. Its totient is φ = 7204003671040.
The previous prime is 22404042142201. The next prime is 22404042142399. The reversal of 22404042142332 is 23324124040422.
It is a happy number.
It is a super-2 number, since 2×224040421423322 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22404042142293 and 22404042142302.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 255780207 + ... + 255867782.
It is an arithmetic number, because the mean of its divisors is an integer number (1128183817950).
Almost surely, 222404042142332 is an apocalyptic number.
It is an amenable number.
22404042142332 is an abundant number, since it is smaller than the sum of its proper divisors (31748781119268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22404042142332 is a wasteful number, since it uses less digits than its factorization.
22404042142332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 511648126 (or 511648124 counting only the distinct ones).
The product of its (nonzero) digits is 73728, while the sum is 33.
Adding to 22404042142332 its reverse (23324124040422), we get a palindrome (45728166182754).
The spelling of 22404042142332 in words is "twenty-two trillion, four hundred four billion, forty-two million, one hundred forty-two thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •