Base | Representation |
---|---|
bin | 111101100101110001… |
… | …0100111110101000001 |
3 | 110122101200210202010000 |
4 | 1323023202213311001 |
5 | 4131334022313021 |
6 | 140432225430213 |
7 | 12361423225512 |
oct | 1731342476501 |
9 | 418350722100 |
10 | 132263869761 |
11 | 51102562a81 |
12 | 21772a9b369 |
13 | c61ac0963a |
14 | 658a010a09 |
15 | 3691999b26 |
hex | 1ecb8a7d41 |
132263869761 has 45 divisors (see below), whose sum is σ = 209973677529. Its totient is φ = 82954181376.
The previous prime is 132263869729. The next prime is 132263869799. The reversal of 132263869761 is 167968362231.
The square root of 132263869761 is 363681.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 4729175361 + 127534694400 = 68769^2 + 357120^2 .
It is not a de Polignac number, because 132263869761 - 25 = 132263869729 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 132263869698 and 132263869707.
It is not an unprimeable number, because it can be changed into a prime (132263869061) by changing a digit.
It is a polite number, since it can be written in 44 ways as a sum of consecutive naturals, for example, 55642005 + ... + 55644381.
Almost surely, 2132263869761 is an apocalyptic number.
132263869761 is the 363681-st square number.
132263869761 is the 181841-st centered octagonal number.
It is an amenable number.
132263869761 is a deficient number, since it is larger than the sum of its proper divisors (77709807768).
132263869761 is an frugal number, since it uses more digits than its factorization.
132263869761 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4800 (or 2397 counting only the distinct ones).
The product of its digits is 3919104, while the sum is 54.
The spelling of 132263869761 in words is "one hundred thirty-two billion, two hundred sixty-three million, eight hundred sixty-nine thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •