Base | Representation |
---|---|
bin | 1010000111100011111000… |
… | …00001000000011101111101 |
3 | 2220210002011112112212022201 |
4 | 11003301330001000131331 |
5 | 10404021010333412000 |
6 | 115153303011311501 |
7 | 4454340006650305 |
oct | 503617401003575 |
9 | 86702145485281 |
10 | 22250011232125 |
11 | 70a91a4313a16 |
12 | 25b424b8ab591 |
13 | c5522303a601 |
14 | 56cc98c04605 |
15 | 288b91b4a96a |
hex | 143c7c04077d |
22250011232125 has 64 divisors (see below), whose sum is σ = 30418753996800. Its totient is φ = 16173408384000.
The previous prime is 22250011232083. The next prime is 22250011232143. The reversal of 22250011232125 is 52123211005222.
It is a happy number.
It is not a de Polignac number, because 22250011232125 - 27 = 22250011231997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22250011232093 and 22250011232102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 770975946 + ... + 771004804.
It is an arithmetic number, because the mean of its divisors is an integer number (475293031200).
Almost surely, 222250011232125 is an apocalyptic number.
22250011232125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
22250011232125 is a deficient number, since it is larger than the sum of its proper divisors (8168742764675).
22250011232125 is a wasteful number, since it uses less digits than its factorization.
22250011232125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41431 (or 41421 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 28.
Adding to 22250011232125 its reverse (52123211005222), we get a palindrome (74373222237347).
The spelling of 22250011232125 in words is "twenty-two trillion, two hundred fifty billion, eleven million, two hundred thirty-two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •