Base | Representation |
---|---|
bin | 1010001111101101111000… |
… | …01010110111100001110100 |
3 | 2221202212112120212100011120 |
4 | 11013312330022313201310 |
5 | 10423113433132324022 |
6 | 115530131520303540 |
7 | 4513520566602153 |
oct | 507667412674164 |
9 | 87685476770146 |
10 | 22530260433012 |
11 | 71a7036719542 |
12 | 263a622771bb0 |
13 | c75795cb4327 |
14 | 57c682bad59a |
15 | 2910e53b5d5c |
hex | 147dbc2b7874 |
22530260433012 has 48 divisors (see below), whose sum is σ = 55730141530560. Its totient is φ = 7059790628352.
The previous prime is 22530260433011. The next prime is 22530260433071. The reversal of 22530260433012 is 21033406203522.
It is a super-3 number, since 3×225302604330123 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22530260433011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 66442738 + ... + 66780969.
It is an arithmetic number, because the mean of its divisors is an integer number (1161044615220).
Almost surely, 222530260433012 is an apocalyptic number.
It is an amenable number.
22530260433012 is an abundant number, since it is smaller than the sum of its proper divisors (33199881097548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22530260433012 is a wasteful number, since it uses less digits than its factorization.
22530260433012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133224560 (or 133224558 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 33.
Adding to 22530260433012 its reverse (21033406203522), we get a palindrome (43563666636534).
The spelling of 22530260433012 in words is "twenty-two trillion, five hundred thirty billion, two hundred sixty million, four hundred thirty-three thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •