Base | Representation |
---|---|
bin | 11101011001011001001… |
… | …100101011000000101001 |
3 | 21011010022102002212111011 |
4 | 131121121030223000221 |
5 | 231044212031420431 |
6 | 4144011352503521 |
7 | 265643506141330 |
oct | 35313114530051 |
9 | 7133272085434 |
10 | 2020131123241 |
11 | 709807399720 |
12 | 2876219aaba1 |
13 | 11866115bb0a |
14 | 6dabc348d17 |
15 | 378354e9cb1 |
hex | 1d65932b029 |
2020131123241 has 16 divisors (see below), whose sum is σ = 2628109605888. Its totient is φ = 1505687792400.
The previous prime is 2020131123223. The next prime is 2020131123259. The reversal of 2020131123241 is 1423211310202.
It is an interprime number because it is at equal distance from previous prime (2020131123223) and next prime (2020131123259).
It is not a de Polignac number, because 2020131123241 - 213 = 2020131115049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2020131123211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 570334515 + ... + 570338056.
It is an arithmetic number, because the mean of its divisors is an integer number (164256850368).
Almost surely, 22020131123241 is an apocalyptic number.
It is an amenable number.
2020131123241 is a deficient number, since it is larger than the sum of its proper divisors (607978482647).
2020131123241 is a wasteful number, since it uses less digits than its factorization.
2020131123241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1140672612.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 2020131123241 its reverse (1423211310202), we get a palindrome (3443342433443).
The spelling of 2020131123241 in words is "two trillion, twenty billion, one hundred thirty-one million, one hundred twenty-three thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •