Base | Representation |
---|---|
bin | 11101001111111110000… |
… | …000010001111000010011 |
3 | 21010011012010201011220000 |
4 | 131033332000101320103 |
5 | 230413000332311311 |
6 | 4135215244021043 |
7 | 265134644261652 |
oct | 35177600217023 |
9 | 7104163634800 |
10 | 2010011213331 |
11 | 705493a24610 |
12 | 285678831783 |
13 | 11770a679744 |
14 | 6d3dc2d1199 |
15 | 37441d53056 |
hex | 1d3fe011e13 |
2010011213331 has 80 divisors (see below), whose sum is σ = 3309401977728. Its totient is φ = 1205670355200.
The previous prime is 2010011213311. The next prime is 2010011213351. The reversal of 2010011213331 is 1333121100102.
2010011213331 is a `hidden beast` number, since 20 + 100 + 1 + 1 + 213 + 331 = 666.
It is an interprime number because it is at equal distance from previous prime (2010011213311) and next prime (2010011213351).
It is not a de Polignac number, because 2010011213331 - 26 = 2010011213267 is a prime.
It is a super-5 number, since 5×20100112133315 (a number of 63 digits) contains 55555 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (2010011213311) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 34972440 + ... + 35029866.
Almost surely, 22010011213331 is an apocalyptic number.
2010011213331 is a deficient number, since it is larger than the sum of its proper divisors (1299390764397).
2010011213331 is a wasteful number, since it uses less digits than its factorization.
2010011213331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57854 (or 57845 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 2010011213331 its reverse (1333121100102), we get a palindrome (3343132313433).
The spelling of 2010011213331 in words is "two trillion, ten billion, eleven million, two hundred thirteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •