Base | Representation |
---|---|
bin | 11101011001011111110… |
… | …000010000100001000001 |
3 | 21011010121002002001002110 |
4 | 131121133300100201001 |
5 | 231044423211141301 |
6 | 4144030322205533 |
7 | 265646313100521 |
oct | 35313760204101 |
9 | 7133532061073 |
10 | 2020241115201 |
11 | 709863495271 |
12 | 2876527b38a9 |
13 | 11867ab9060a |
14 | 6daccbbb681 |
15 | 3783eec50d6 |
hex | 1d65fc10841 |
2020241115201 has 4 divisors (see below), whose sum is σ = 2693654820272. Its totient is φ = 1346827410132.
The previous prime is 2020241115163. The next prime is 2020241115287. The reversal of 2020241115201 is 1025111420202.
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 not a de Polignac number, because 2020241115201 - 27 = 2020241115073 is a prime.
It is a super-3 number, since 3×20202411152013 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2020241115001) 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, 336706852531 + ... + 336706852536.
It is an arithmetic number, because the mean of its divisors is an integer number (673413705068).
Almost surely, 22020241115201 is an apocalyptic number.
It is an amenable number.
2020241115201 is a deficient number, since it is larger than the sum of its proper divisors (673413705071).
2020241115201 is an equidigital number, since it uses as much as digits as its factorization.
2020241115201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 673413705070.
The product of its (nonzero) digits is 320, while the sum is 21.
Adding to 2020241115201 its reverse (1025111420202), we get a palindrome (3045352535403).
The spelling of 2020241115201 in words is "two trillion, twenty billion, two hundred forty-one million, one hundred fifteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •