Base | Representation |
---|---|
bin | 1010000101111110110001… |
… | …11101010000110011000000 |
3 | 2220120220002000001012022120 |
4 | 11002333120331100303000 |
5 | 10402123331401103142 |
6 | 115112325204004240 |
7 | 4450406012505525 |
oct | 502773075206300 |
9 | 86526060035276 |
10 | 22195735956672 |
11 | 7088182340173 |
12 | 25a5823090680 |
13 | c500836270c5 |
14 | 56a3ca78514c |
15 | 287566ca77ec |
hex | 142fd8f50cc0 |
22195735956672 has 112 divisors (see below), whose sum is σ = 59421849477120. Its totient is φ = 7311040247808.
The previous prime is 22195735956661. The next prime is 22195735956707. The reversal of 22195735956672 is 27665953759122.
It is a super-2 number, since 2×221957359566722 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22195735956597 and 22195735956606.
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, 28026813 + ... + 28807875.
Almost surely, 222195735956672 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 22195735956672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29710924738560).
22195735956672 is an abundant number, since it is smaller than the sum of its proper divisors (37226113520448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22195735956672 is a wasteful number, since it uses less digits than its factorization.
22195735956672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 782830 (or 782820 counting only the distinct ones).
The product of its digits is 428652000, while the sum is 69.
The spelling of 22195735956672 in words is "twenty-two trillion, one hundred ninety-five billion, seven hundred thirty-five million, nine hundred fifty-six thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •