Base | Representation |
---|---|
bin | 1001101001101101100111… |
… | …11011100011000001100001 |
3 | 2210011001000120012002101201 |
4 | 10310312303323203001201 |
5 | 10240220134222004103 |
6 | 113050213445001201 |
7 | 4320262465343122 |
oct | 464666373430141 |
9 | 83131016162351 |
10 | 21224452141153 |
11 | 684326aa05748 |
12 | 24695360b3201 |
13 | bac5c3764201 |
14 | 5353aa07a049 |
15 | 26c16b5c551d |
hex | 134db3ee3061 |
21224452141153 has 8 divisors (see below), whose sum is σ = 21365974647360. Its totient is φ = 21082942309200.
The previous prime is 21224452141121. The next prime is 21224452141201. The reversal of 21224452141153 is 35114125442212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21224452141153 - 25 = 21224452141121 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21224452141103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 203751 + ... + 6518467.
It is an arithmetic number, because the mean of its divisors is an integer number (2670746830920).
Almost surely, 221224452141153 is an apocalyptic number.
It is an amenable number.
21224452141153 is a deficient number, since it is larger than the sum of its proper divisors (141522506207).
21224452141153 is a wasteful number, since it uses less digits than its factorization.
21224452141153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6337127.
The product of its digits is 76800, while the sum is 37.
Adding to 21224452141153 its reverse (35114125442212), we get a palindrome (56338577583365).
The spelling of 21224452141153 in words is "twenty-one trillion, two hundred twenty-four billion, four hundred fifty-two million, one hundred forty-one thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •