Base | Representation |
---|---|
bin | 111110000100000101… |
… | …1011111010110111001 |
3 | 110202000121010021200201 |
4 | 1330020023133112321 |
5 | 4140424442402204 |
6 | 141121211002201 |
7 | 12425555433361 |
oct | 1741013372671 |
9 | 422017107621 |
10 | 133281215929 |
11 | 51584854234 |
12 | 219b7739361 |
13 | c75090b014 |
14 | 66451959a1 |
15 | 3700e559a4 |
hex | 1f082df5b9 |
133281215929 has 9 divisors (see below), whose sum is σ = 134088123501. Its totient is φ = 132479141760.
The previous prime is 133281215927. The next prime is 133281215933. The reversal of 133281215929 is 929512182331.
The square root of 133281215929 is 365077.
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 11516509225 + 121764706704 = 107315^2 + 348948^2 .
It is not a de Polignac number, because 133281215929 - 21 = 133281215927 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133281215927) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 66077929 + ... + 66079945.
It is an arithmetic number, because the mean of its divisors is an integer number (14898680389).
Almost surely, 2133281215929 is an apocalyptic number.
133281215929 is the 365077-th square number.
133281215929 is the 182539-th centered octagonal number.
It is an amenable number.
133281215929 is a deficient number, since it is larger than the sum of its proper divisors (806907572).
133281215929 is an frugal number, since it uses more digits than its factorization.
133281215929 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4396 (or 2198 counting only the distinct ones).
The product of its digits is 233280, while the sum is 46.
The spelling of 133281215929 in words is "one hundred thirty-three billion, two hundred eighty-one million, two hundred fifteen thousand, nine hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •