Base | Representation |
---|---|
bin | 1010000001101011110010… |
… | …10100110111101110011011 |
3 | 2220001210000011220212222202 |
4 | 11000311321110313232123 |
5 | 10342214003234112020 |
6 | 114520431501440415 |
7 | 4433631352166264 |
oct | 500657124675633 |
9 | 86053004825882 |
10 | 22048102644635 |
11 | 7030603171791 |
12 | 25810a0b7010b |
13 | c3c18649bc32 |
14 | 5631c346196b |
15 | 2837c5d6de75 |
hex | 140d79537b9b |
22048102644635 has 8 divisors (see below), whose sum is σ = 26533970216496. Its totient is φ = 17587650753760.
The previous prime is 22048102644593. The next prime is 22048102644637. The reversal of 22048102644635 is 53644620184022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 22048102644635 - 26 = 22048102644571 is a prime.
It is a super-2 number, since 2×220481026446352 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 22048102644635.
It is not an unprimeable number, because it can be changed into a prime (22048102644637) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6353918336 + ... + 6353921805.
It is an arithmetic number, because the mean of its divisors is an integer number (3316746277062).
Almost surely, 222048102644635 is an apocalyptic number.
22048102644635 is a deficient number, since it is larger than the sum of its proper divisors (4485867571861).
22048102644635 is a wasteful number, since it uses less digits than its factorization.
22048102644635 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12707840493.
The product of its (nonzero) digits is 2211840, while the sum is 47.
The spelling of 22048102644635 in words is "twenty-two trillion, forty-eight billion, one hundred two million, six hundred forty-four thousand, six hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •