Base | Representation |
---|---|
bin | 111100011010011… |
… | …1111000001001011 |
3 | 12020021110011121111 |
4 | 1320310333001023 |
5 | 13122422434111 |
6 | 533052551151 |
7 | 101143352302 |
oct | 17064770113 |
9 | 5207404544 |
10 | 2027155531 |
11 | 950304a55 |
12 | 486a824b7 |
13 | 263c9471b |
14 | 153327439 |
15 | bce78a21 |
hex | 78d3f04b |
2027155531 has 24 divisors (see below), whose sum is σ = 2262034944. Its totient is φ = 1812792960.
The previous prime is 2027155511. The next prime is 2027155541. The reversal of 2027155531 is 1355517202.
It is not a de Polignac number, because 2027155531 - 25 = 2027155499 is a prime.
It is a super-2 number, since 2×20271555312 = 8218719093727783922, 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 = 2027155493 and 2027155502.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2027155511) 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 23 ways as a sum of consecutive naturals, for example, 1082526 + ... + 1084396.
It is an arithmetic number, because the mean of its divisors is an integer number (94251456).
Almost surely, 22027155531 is an apocalyptic number.
2027155531 is a deficient number, since it is larger than the sum of its proper divisors (234879413).
2027155531 is a wasteful number, since it uses less digits than its factorization.
2027155531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2091 (or 2074 counting only the distinct ones).
The product of its (nonzero) digits is 10500, while the sum is 31.
The square root of 2027155531 is about 45023.9439742899. The cubic root of 2027155531 is about 1265.5977388314.
The spelling of 2027155531 in words is "two billion, twenty-seven million, one hundred fifty-five thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •