Base | Representation |
---|---|
bin | 1010001100110011011000… |
… | …01001000001111000100100 |
3 | 2221102022002120102110022002 |
4 | 11012121230021001320210 |
5 | 10414443403140313202 |
6 | 115412132221224432 |
7 | 4503344422124420 |
oct | 506315411017044 |
9 | 87368076373262 |
10 | 22430133526052 |
11 | 716862569435a |
12 | 262313a402118 |
13 | c691ca0ccc15 |
14 | 5778a4d55b80 |
15 | 28d6d4e5e302 |
hex | 14666c241e24 |
22430133526052 has 48 divisors (see below), whose sum is σ = 44882832580992. Its totient is φ = 9608080204800.
The previous prime is 22430133526013. The next prime is 22430133526069. The reversal of 22430133526052 is 25062533103422.
It is a super-3 number, since 3×224301335260523 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 22430133525997 and 22430133526015.
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, 486604718 + ... + 486650810.
It is an arithmetic number, because the mean of its divisors is an integer number (935059012104).
Almost surely, 222430133526052 is an apocalyptic number.
It is an amenable number.
22430133526052 is an abundant number, since it is smaller than the sum of its proper divisors (22452699054940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22430133526052 is a wasteful number, since it uses less digits than its factorization.
22430133526052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54468 (or 54466 counting only the distinct ones).
The product of its (nonzero) digits is 259200, while the sum is 38.
Adding to 22430133526052 its reverse (25062533103422), we get a palindrome (47492666629474).
The spelling of 22430133526052 in words is "twenty-two trillion, four hundred thirty billion, one hundred thirty-three million, five hundred twenty-six thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •