Base | Representation |
---|---|
bin | 11101001111111101111… |
… | …111100101111011100001 |
3 | 21010011012010101000221200 |
4 | 131033331333211323201 |
5 | 230413000311031223 |
6 | 4135215240111413 |
7 | 265134642612063 |
oct | 35177577457341 |
9 | 7104163330850 |
10 | 2010011033313 |
11 | 705493911338 |
12 | 285678765569 |
13 | 11770a61581a |
14 | 6d3dc285733 |
15 | 37441d19a43 |
hex | 1d3fdfe5ee1 |
2010011033313 has 12 divisors (see below), whose sum is σ = 2904451981860. Its totient is φ = 1339498411776.
The previous prime is 2010011033291. The next prime is 2010011033377. The reversal of 2010011033313 is 3133301100102.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 227016990369 + 1782994042944 = 476463^2 + 1335288^2 .
It is not a de Polignac number, because 2010011033313 - 221 = 2010008936161 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2010011033713) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 42386968 + ... + 42434361.
It is an arithmetic number, because the mean of its divisors is an integer number (242037665155).
Almost surely, 22010011033313 is an apocalyptic number.
It is an amenable number.
2010011033313 is a deficient number, since it is larger than the sum of its proper divisors (894440948547).
2010011033313 is a wasteful number, since it uses less digits than its factorization.
2010011033313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84823968 (or 84823965 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 2010011033313 its reverse (3133301100102), we get a palindrome (5143312133415).
The spelling of 2010011033313 in words is "two trillion, ten billion, eleven million, thirty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •