Base | Representation |
---|---|
bin | 1001010100110000100110… |
… | …11100001101101001010011 |
3 | 2200121012200212021122020001 |
4 | 10222120103130031221103 |
5 | 10141421204002043011 |
6 | 111335345352430431 |
7 | 4214254424403301 |
oct | 452302334155123 |
9 | 80535625248201 |
10 | 20504500034131 |
11 | 6595a00799803 |
12 | 2371aab6a8417 |
13 | b5974881a9a9 |
14 | 50c5ccd99271 |
15 | 258580ab27c1 |
hex | 12a61370da53 |
20504500034131 has 16 divisors (see below), whose sum is σ = 21074441923584. Its totient is φ = 19940188820544.
The previous prime is 20504500034107. The next prime is 20504500034149. The reversal of 20504500034131 is 13143000540502.
It is a cyclic number.
It is not a de Polignac number, because 20504500034131 - 211 = 20504500032083 is a prime.
It is a super-2 number, since 2×205045000341312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20504500034131.
It is not an unprimeable number, because it can be changed into a prime (20504500034531) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 30874690 + ... + 31531816.
It is an arithmetic number, because the mean of its divisors is an integer number (1317152620224).
Almost surely, 220504500034131 is an apocalyptic number.
20504500034131 is a deficient number, since it is larger than the sum of its proper divisors (569941889453).
20504500034131 is a wasteful number, since it uses less digits than its factorization.
20504500034131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 661410.
The product of its (nonzero) digits is 7200, while the sum is 28.
Adding to 20504500034131 its reverse (13143000540502), we get a palindrome (33647500574633).
The spelling of 20504500034131 in words is "twenty trillion, five hundred four billion, five hundred million, thirty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •