Base | Representation |
---|---|
bin | 111111000011010… |
… | …1010100010101011 |
3 | 12110110000111022122 |
4 | 1332012222202223 |
5 | 13313103120311 |
6 | 545534141455 |
7 | 103266644366 |
oct | 17606524253 |
9 | 5413014278 |
10 | 2115676331 |
11 | 996275a3a |
12 | 4b065188b |
13 | 2794192b2 |
14 | 160dab0dd |
15 | c5b120db |
hex | 7e1aa8ab |
2115676331 has 4 divisors (see below), whose sum is σ = 2131826664. Its totient is φ = 2099526000.
The previous prime is 2115676309. The next prime is 2115676351. The reversal of 2115676331 is 1336765112.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2115676331 - 226 = 2048567467 is a prime.
It is a super-2 number, since 2×21156763312 = 8952172675107243122, 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 = 2115676291 and 2115676300.
It is not an unprimeable number, because it can be changed into a prime (2115676351) 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 3 ways as a sum of consecutive naturals, for example, 8074970 + ... + 8075231.
It is an arithmetic number, because the mean of its divisors is an integer number (532956666).
Almost surely, 22115676331 is an apocalyptic number.
2115676331 is a deficient number, since it is larger than the sum of its proper divisors (16150333).
2115676331 is a wasteful number, since it uses less digits than its factorization.
2115676331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16150332.
The product of its digits is 22680, while the sum is 35.
The square root of 2115676331 is about 45996.4817241493. The cubic root of 2115676331 is about 1283.7577422549.
The spelling of 2115676331 in words is "two billion, one hundred fifteen million, six hundred seventy-six thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •