Base | Representation |
---|---|
bin | 10100111111101010… |
… | …111011100100100101 |
3 | 2011012001201212002012 |
4 | 110333222323210211 |
5 | 332132010231031 |
6 | 14204531524005 |
7 | 1425431543555 |
oct | 247752734445 |
9 | 64161655065 |
10 | 22543055141 |
11 | 9618a6aa92 |
12 | 4451759605 |
13 | 21835003a9 |
14 | 113bd43165 |
15 | 8be14db2b |
hex | 53fabb925 |
22543055141 has 8 divisors (see below), whose sum is σ = 23702705400. Its totient is φ = 21408891840.
The previous prime is 22543055131. The next prime is 22543055147. The reversal of 22543055141 is 14155034522.
It can be written as a sum of positive squares in 4 ways, for example, as 1229975041 + 21313080100 = 35071^2 + 145990^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 22543055141 - 214 = 22543038757 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22543055098 and 22543055107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22543055147) 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, 6369926 + ... + 6373463.
It is an arithmetic number, because the mean of its divisors is an integer number (2962838175).
Almost surely, 222543055141 is an apocalyptic number.
It is an amenable number.
22543055141 is a deficient number, since it is larger than the sum of its proper divisors (1159650259).
22543055141 is a wasteful number, since it uses less digits than its factorization.
22543055141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12743479.
The product of its (nonzero) digits is 24000, while the sum is 32.
Adding to 22543055141 its reverse (14155034522), we get a palindrome (36698089663).
The spelling of 22543055141 in words is "twenty-two billion, five hundred forty-three million, fifty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •