Base | Representation |
---|---|
bin | 11101100101100000111… |
… | …110011011101111101001 |
3 | 21012100220110212001001012 |
4 | 131211200332123233221 |
5 | 231302341001312223 |
6 | 4154003053433305 |
7 | 266614160123252 |
oct | 35454076335751 |
9 | 7170813761035 |
10 | 2033146510313 |
11 | 714286223666 |
12 | 28a05479b835 |
13 | 11995678a399 |
14 | 70594b5bb29 |
15 | 37d47e8ac78 |
hex | 1d960f9bbe9 |
2033146510313 has 4 divisors (see below), whose sum is σ = 2039560222020. Its totient is φ = 2026732798608.
The previous prime is 2033146510259. The next prime is 2033146510379. The reversal of 2033146510313 is 3130156413302.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 79181457664 + 1953965052649 = 281392^2 + 1397843^2 .
It is a cyclic number.
It is not a de Polignac number, because 2033146510313 - 226 = 2033079401449 is a prime.
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 2033146510313.
It is not an unprimeable number, because it can be changed into a prime (2033146510513) 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, 3206855378 + ... + 3206856011.
It is an arithmetic number, because the mean of its divisors is an integer number (509890055505).
Almost surely, 22033146510313 is an apocalyptic number.
It is an amenable number.
2033146510313 is a deficient number, since it is larger than the sum of its proper divisors (6413711707).
2033146510313 is an equidigital number, since it uses as much as digits as its factorization.
2033146510313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6413711706.
The product of its (nonzero) digits is 19440, while the sum is 32.
The spelling of 2033146510313 in words is "two trillion, thirty-three billion, one hundred forty-six million, five hundred ten thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •