Base | Representation |
---|---|
bin | 1010000000111011101001… |
… | …00001110110001000110010 |
3 | 2212222022021122001011122120 |
4 | 11000131310201312020302 |
5 | 10341303033100344041 |
6 | 114500514424215110 |
7 | 4432024641312600 |
oct | 500356441661062 |
9 | 85868248034576 |
10 | 22022252356146 |
11 | 70206483773a9 |
12 | 257808790a496 |
13 | c398c6a56043 |
14 | 561c501bc870 |
15 | 282cb16de366 |
hex | 140774876232 |
22022252356146 has 48 divisors (see below), whose sum is σ = 51284194210080. Its totient is φ = 6286085265600.
The previous prime is 22022252356129. The next prime is 22022252356151. The reversal of 22022252356146 is 64165325222022.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 22022252356098 and 22022252356107.
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 23 ways as a sum of consecutive naturals, for example, 35326411 + ... + 35944398.
It is an arithmetic number, because the mean of its divisors is an integer number (1068420712710).
Almost surely, 222022252356146 is an apocalyptic number.
22022252356146 is an abundant number, since it is smaller than the sum of its proper divisors (29261941853934).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22022252356146 is a wasteful number, since it uses less digits than its factorization.
22022252356146 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71271879 (or 71271872 counting only the distinct ones).
The product of its (nonzero) digits is 691200, while the sum is 42.
Adding to 22022252356146 its reverse (64165325222022), we get a palindrome (86187577578168).
The spelling of 22022252356146 in words is "twenty-two trillion, twenty-two billion, two hundred fifty-two million, three hundred fifty-six thousand, one hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •