Base | Representation |
---|---|
bin | 1011100110111110… |
… | …1100010010100111 |
3 | 22001011211210022100 |
4 | 2321233230102213 |
5 | 22340232142033 |
6 | 1233120503143 |
7 | 140140001154 |
oct | 27157542247 |
9 | 8034753270 |
10 | 3116287143 |
11 | 135a076722 |
12 | 72b77aab3 |
13 | 3a880b4b8 |
14 | 217c3722b |
15 | 1338b4513 |
hex | b9bec4a7 |
3116287143 has 6 divisors (see below), whose sum is σ = 4501303664. Its totient is φ = 2077524756.
The previous prime is 3116287127. The next prime is 3116287211. The reversal of 3116287143 is 3417826113.
It is a happy number.
3116287143 is a `hidden beast` number, since 3 + 11 + 628 + 7 + 14 + 3 = 666.
It is not a de Polignac number, because 3116287143 - 24 = 3116287127 is a prime.
It is a super-2 number, since 2×31162871432 = 19422491115254204898, 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 = 3116287098 and 3116287107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3116287103) 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 5 ways as a sum of consecutive naturals, for example, 173127055 + ... + 173127072.
Almost surely, 23116287143 is an apocalyptic number.
3116287143 is a deficient number, since it is larger than the sum of its proper divisors (1385016521).
3116287143 is a wasteful number, since it uses less digits than its factorization.
3116287143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 346254133 (or 346254130 counting only the distinct ones).
The product of its digits is 24192, while the sum is 36.
The square root of 3116287143 is about 55823.7148799684. The cubic root of 3116287143 is about 1460.6488551151.
The spelling of 3116287143 in words is "three billion, one hundred sixteen million, two hundred eighty-seven thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •