Base | Representation |
---|---|
bin | 11101011001010011010… |
… | …110110000010100011011 |
3 | 21011010001120122221011201 |
4 | 131121103112300110123 |
5 | 231044011433300011 |
6 | 4143553531535031 |
7 | 265641206033401 |
oct | 35312326602433 |
9 | 7133046587151 |
10 | 2020033103131 |
11 | 70976702a76a |
12 | 2875b4bba477 |
13 | 118646a5c554 |
14 | 6daad311471 |
15 | 3782bad6cc1 |
hex | 1d6535b051b |
2020033103131 has 4 divisors (see below), whose sum is σ = 2020222663672. Its totient is φ = 2019843542592.
The previous prime is 2020033103113. The next prime is 2020033103197. The reversal of 2020033103131 is 1313013300202.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2020033103131 - 211 = 2020033101083 is a prime.
It is a super-2 number, since 2×20200331031312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2020033103099 and 2020033103108.
It is not an unprimeable number, because it can be changed into a prime (2020033103111) 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, 94764285 + ... + 94785598.
It is an arithmetic number, because the mean of its divisors is an integer number (505055665918).
Almost surely, 22020033103131 is an apocalyptic number.
2020033103131 is a deficient number, since it is larger than the sum of its proper divisors (189560541).
2020033103131 is a wasteful number, since it uses less digits than its factorization.
2020033103131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 189560540.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 2020033103131 its reverse (1313013300202), we get a palindrome (3333046403333).
The spelling of 2020033103131 in words is "two trillion, twenty billion, thirty-three million, one hundred three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •