Base | Representation |
---|---|
bin | 1010000000010111001011… |
… | …00001111010000000110100 |
3 | 2212220102202010201011102021 |
4 | 11000023211201322000310 |
5 | 10340442433340022243 |
6 | 114443515534322524 |
7 | 4430432520513130 |
oct | 500134541720064 |
9 | 85812663634367 |
10 | 22002673360948 |
11 | 701331055a535 |
12 | 2574322959444 |
13 | c37ac6665597 |
14 | 560d13ba83c0 |
15 | 2825178d56ed |
hex | 1402e587a034 |
22002673360948 has 12 divisors (see below), whose sum is σ = 44005346721952. Its totient is φ = 9429717154680.
The previous prime is 22002673360883. The next prime is 22002673361059. The reversal of 22002673360948 is 84906337620022.
22002673360948 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 22002673360895 and 22002673360904.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 392904881418 + ... + 392904881473.
Almost surely, 222002673360948 is an apocalyptic number.
22002673360948 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
22002673360948 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22002673360948 is a wasteful number, since it uses less digits than its factorization.
22002673360948 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 785809762902 (or 785809762900 counting only the distinct ones).
The product of its (nonzero) digits is 5225472, while the sum is 52.
The spelling of 22002673360948 in words is "twenty-two trillion, two billion, six hundred seventy-three million, three hundred sixty thousand, nine hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •