Base | Representation |
---|---|
bin | 1001010101110111000011… |
… | …10100010101011010000001 |
3 | 2200201211022202100212000011 |
4 | 10222323201310111122001 |
5 | 10143031133440432431 |
6 | 111405002413024521 |
7 | 4220063615464060 |
oct | 452734164253201 |
9 | 80654282325004 |
10 | 20542322202241 |
11 | 65aaa4a389484 |
12 | 23792a6185141 |
13 | b60195630b18 |
14 | 51037a21a1d7 |
15 | 2595462aacb1 |
hex | 12aee1d15681 |
20542322202241 has 8 divisors (see below), whose sum is σ = 24234260294144. Its totient is φ = 17039714268960.
The previous prime is 20542322202221. The next prime is 20542322202247. The reversal of 20542322202241 is 14220222324502.
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 20542322202241 - 29 = 20542322201729 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20542322202247) 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, 47332539420 + ... + 47332539853.
It is an arithmetic number, because the mean of its divisors is an integer number (3029282536768).
Almost surely, 220542322202241 is an apocalyptic number.
It is an amenable number.
20542322202241 is a deficient number, since it is larger than the sum of its proper divisors (3691938091903).
20542322202241 is an equidigital number, since it uses as much as digits as its factorization.
20542322202241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94665079311.
The product of its (nonzero) digits is 30720, while the sum is 31.
Adding to 20542322202241 its reverse (14220222324502), we get a palindrome (34762544526743).
The spelling of 20542322202241 in words is "twenty trillion, five hundred forty-two billion, three hundred twenty-two million, two hundred two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •