Base | Representation |
---|---|
bin | 1010000111101001100010… |
… | …11001110100111011001101 |
3 | 2220210101000121211112210120 |
4 | 11003310301121310323031 |
5 | 10404043223412231131 |
6 | 115154525001255153 |
7 | 4454505301404246 |
oct | 503646131647315 |
9 | 86711017745716 |
10 | 22253054414541 |
11 | 70aa516098a05 |
12 | 25b495aa944b9 |
13 | c555b9661072 |
14 | 56d0a704bccd |
15 | 288cbddbe496 |
hex | 143d31674ecd |
22253054414541 has 8 divisors (see below), whose sum is σ = 31232357073120. Its totient is φ = 14054560682832.
The previous prime is 22253054414527. The next prime is 22253054414567. The reversal of 22253054414541 is 14541445035222.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 22253054414541 - 218 = 22253054152397 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22253054414493 and 22253054414502.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22253054414581) 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, 195202231650 + ... + 195202231763.
It is an arithmetic number, because the mean of its divisors is an integer number (3904044634140).
Almost surely, 222253054414541 is an apocalyptic number.
It is an amenable number.
22253054414541 is a deficient number, since it is larger than the sum of its proper divisors (8979302658579).
22253054414541 is a wasteful number, since it uses less digits than its factorization.
22253054414541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 390404463435.
The product of its (nonzero) digits is 768000, while the sum is 42.
Adding to 22253054414541 its reverse (14541445035222), we get a palindrome (36794499449763).
The spelling of 22253054414541 in words is "twenty-two trillion, two hundred fifty-three billion, fifty-four million, four hundred fourteen thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •