Base | Representation |
---|---|
bin | 1001010101110100110010… |
… | …00110000110010011100101 |
3 | 2200201201011201120100211222 |
4 | 10222322121012012103211 |
5 | 10143021134120402323 |
6 | 111404241350310125 |
7 | 4220021442124331 |
oct | 452723106062345 |
9 | 80651151510758 |
10 | 20541102122213 |
11 | 65aa483708282 |
12 | 2379005658345 |
13 | b6002c92898a |
14 | 5102a21807c1 |
15 | 2594c41059c8 |
hex | 12ae991864e5 |
20541102122213 has 4 divisors (see below), whose sum is σ = 20542047040320. Its totient is φ = 20540157204108.
The previous prime is 20541102122201. The next prime is 20541102122231. The reversal of 20541102122213 is 31222120114502.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 20541102122213 - 244 = 2948916077797 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20541102122273) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 472426445 + ... + 472469922.
It is an arithmetic number, because the mean of its divisors is an integer number (5135511760080).
Almost surely, 220541102122213 is an apocalyptic number.
It is an amenable number.
20541102122213 is a deficient number, since it is larger than the sum of its proper divisors (944918107).
20541102122213 is an equidigital number, since it uses as much as digits as its factorization.
20541102122213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 944918106.
The product of its (nonzero) digits is 1920, while the sum is 26.
Adding to 20541102122213 its reverse (31222120114502), we get a palindrome (51763222236715).
The spelling of 20541102122213 in words is "twenty trillion, five hundred forty-one billion, one hundred two million, one hundred twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.183 sec. • engine limits •