Base | Representation |
---|---|
bin | 1101010000010000010… |
… | …1000101000000001001 |
3 | 210202201220221012020201 |
4 | 3110010011011000021 |
5 | 12212313114104021 |
6 | 252334341452201 |
7 | 22310442400324 |
oct | 3240405050011 |
9 | 722656835221 |
10 | 227701706761 |
11 | 8862774a531 |
12 | 38168a11061 |
13 | 1861a4b8c39 |
14 | b0411c37bb |
15 | 5dca417591 |
hex | 3504145009 |
227701706761 has 9 divisors (see below), whose sum is σ = 238043692621. Its totient is φ = 217791134572.
The previous prime is 227701706753. The next prime is 227701706767. The reversal of 227701706761 is 167607107722.
The square root of 227701706761 is 477181.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 227701706761 - 23 = 227701706753 is a prime.
It is a super-2 number, since 2×2277017067612 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (227701706767) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 10964790 + ... + 10985536.
Almost surely, 2227701706761 is an apocalyptic number.
227701706761 is the 477181-st square number.
227701706761 is the 238591-st centered octagonal number.
It is an amenable number.
227701706761 is a deficient number, since it is larger than the sum of its proper divisors (10341985860).
227701706761 is an frugal number, since it uses more digits than its factorization.
227701706761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41540 (or 20770 counting only the distinct ones).
The product of its (nonzero) digits is 345744, while the sum is 46.
The spelling of 227701706761 in words is "two hundred twenty-seven billion, seven hundred one million, seven hundred six thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •