Base | Representation |
---|---|
bin | 111100011010010… |
… | …1100111100101001 |
3 | 12020021022102002002 |
4 | 1320310230330221 |
5 | 13122413102023 |
6 | 533051220345 |
7 | 101142623432 |
oct | 17064547451 |
9 | 5207272062 |
10 | 2027081513 |
11 | 950264386 |
12 | 486a476b5 |
13 | 263c69b22 |
14 | 153308489 |
15 | bce61b28 |
hex | 78d2cf29 |
2027081513 has 8 divisors (see below), whose sum is σ = 2186819208. Its totient is φ = 1871843584.
The previous prime is 2027081477. The next prime is 2027081569. The reversal of 2027081513 is 3151807202.
It can be written as a sum of positive squares in 4 ways, for example, as 739132969 + 1287948544 = 27187^2 + 35888^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2027081513 - 212 = 2027077417 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2027081713) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1124006 + ... + 1125807.
It is an arithmetic number, because the mean of its divisors is an integer number (273352401).
Almost surely, 22027081513 is an apocalyptic number.
It is an amenable number.
2027081513 is a deficient number, since it is larger than the sum of its proper divisors (159737695).
2027081513 is a wasteful number, since it uses less digits than its factorization.
2027081513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2249883.
The product of its (nonzero) digits is 3360, while the sum is 29.
The square root of 2027081513 is about 45023.1219819328. The cubic root of 2027081513 is about 1265.5823349560.
Adding to 2027081513 its reverse (3151807202), we get a palindrome (5178888715).
The spelling of 2027081513 in words is "two billion, twenty-seven million, eighty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •