Base | Representation |
---|---|
bin | 1010000001111001100101… |
… | …01000000100110001010111 |
3 | 2220002111010011110012121220 |
4 | 11000330302220010301113 |
5 | 10342324134121243223 |
6 | 114524054302341423 |
7 | 4434313003300410 |
oct | 500746250046127 |
9 | 86074104405556 |
10 | 22055506431063 |
11 | 7033762438046 |
12 | 258260858a873 |
13 | c3ca96340a51 |
14 | 5636c688a807 |
15 | 283aaad486e3 |
hex | 140f32a04c57 |
22055506431063 has 128 divisors (see below), whose sum is σ = 36059937177600. Its totient is φ = 11704764653568.
The previous prime is 22055506431061. The next prime is 22055506431137. The reversal of 22055506431063 is 36013460555022.
It is a happy number.
It is not a de Polignac number, because 22055506431063 - 21 = 22055506431061 is a prime.
It is a super-2 number, since 2×220555064310632 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22055506431061) by changing a digit.
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 127 ways as a sum of consecutive naturals, for example, 9720363093 + ... + 9720365361.
It is an arithmetic number, because the mean of its divisors is an integer number (281718259200).
Almost surely, 222055506431063 is an apocalyptic number.
22055506431063 is a deficient number, since it is larger than the sum of its proper divisors (14004430746537).
22055506431063 is a wasteful number, since it uses less digits than its factorization.
22055506431063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3489.
The product of its (nonzero) digits is 648000, while the sum is 42.
Adding to 22055506431063 its reverse (36013460555022), we get a palindrome (58068966986085).
The spelling of 22055506431063 in words is "twenty-two trillion, fifty-five billion, five hundred six million, four hundred thirty-one thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •