Base | Representation |
---|---|
bin | 111011111010000… |
… | …0011001001111111 |
3 | 12012002102100020210 |
4 | 1313310003021333 |
5 | 13104043224434 |
6 | 531244043503 |
7 | 100545564261 |
oct | 16764031177 |
9 | 5162370223 |
10 | 2010133119 |
11 | 941738845 |
12 | 481233593 |
13 | 2605b46a7 |
14 | 150d75b31 |
15 | bb714ee9 |
hex | 77d0327f |
2010133119 has 4 divisors (see below), whose sum is σ = 2680177496. Its totient is φ = 1340088744.
The previous prime is 2010133109. The next prime is 2010133133. The reversal of 2010133119 is 9113310102.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 2010133119 - 27 = 2010132991 is a prime.
It is a super-2 number, since 2×20101331192 = 8081270312201336322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2010133095 and 2010133104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2010133109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 335022184 + ... + 335022189.
It is an arithmetic number, because the mean of its divisors is an integer number (670044374).
Almost surely, 22010133119 is an apocalyptic number.
2010133119 is a deficient number, since it is larger than the sum of its proper divisors (670044377).
2010133119 is an equidigital number, since it uses as much as digits as its factorization.
2010133119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 670044376.
The product of its (nonzero) digits is 162, while the sum is 21.
The square root of 2010133119 is about 44834.5081271112. The cubic root of 2010133119 is about 1262.0452880524.
The spelling of 2010133119 in words is "two billion, ten million, one hundred thirty-three thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •