Base | Representation |
---|---|
bin | 111110111101111000… |
… | …0001001010010111001 |
3 | 110221000201200010021201 |
4 | 1331323300021102321 |
5 | 4203412333022404 |
6 | 142041434134201 |
7 | 12524611530061 |
oct | 1757360112271 |
9 | 427021603251 |
10 | 135220204729 |
11 | 5238a30a215 |
12 | 22258b81361 |
13 | c99c54307c |
14 | 678a8cc3a1 |
15 | 37b62b5ca4 |
hex | 1f7bc094b9 |
135220204729 has 9 divisors (see below), whose sum is σ = 135824109967. Its totient is φ = 134618977624.
The previous prime is 135220204711. The next prime is 135220204741. The reversal of 135220204729 is 927402022531.
The square root of 135220204729 is 367723.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 8896828329 + 126323376400 = 94323^2 + 355420^2 .
It is not a de Polignac number, because 135220204729 - 27 = 135220204601 is a prime.
It is a super-3 number, since 3×1352202047293 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (135220204789) 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, 98916804 + ... + 98918170.
Almost surely, 2135220204729 is an apocalyptic number.
135220204729 is the 367723-rd square number.
135220204729 is the 183862-nd centered octagonal number.
It is an amenable number.
135220204729 is a deficient number, since it is larger than the sum of its proper divisors (603905238).
135220204729 is an frugal number, since it uses more digits than its factorization.
135220204729 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3272 (or 1636 counting only the distinct ones).
The product of its (nonzero) digits is 60480, while the sum is 37.
The spelling of 135220204729 in words is "one hundred thirty-five billion, two hundred twenty million, two hundred four thousand, seven hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •