Base | Representation |
---|---|
bin | 111110111011001100… |
… | …1111011100011100001 |
3 | 110220210110212101221121 |
4 | 1331312121323203201 |
5 | 4203221401321301 |
6 | 142024511252241 |
7 | 12522442154212 |
oct | 1756631734341 |
9 | 426713771847 |
10 | 135130495201 |
11 | 52343707109 |
12 | 22232b1a081 |
13 | c986a93400 |
14 | 677ca19409 |
15 | 37ad4953a1 |
hex | 1f7667b8e1 |
135130495201 has 9 divisors (see below), whose sum is σ = 146329912281. Its totient is φ = 124731430512.
The previous prime is 135130495151. The next prime is 135130495261. The reversal of 135130495201 is 102594031531.
The square root of 135130495201 is 367601.
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 32960765601 + 102169729600 = 181551^2 + 319640^2 .
It is not a de Polignac number, because 135130495201 - 211 = 135130493153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (135130495261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 4764675 + ... + 4792951.
Almost surely, 2135130495201 is an apocalyptic number.
135130495201 is the 367601-st square number.
135130495201 is the 183801-st centered octagonal number.
It is an amenable number.
135130495201 is a deficient number, since it is larger than the sum of its proper divisors (11199417080).
135130495201 is an frugal number, since it uses more digits than its factorization.
135130495201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56580 (or 28290 counting only the distinct ones).
The product of its (nonzero) digits is 16200, while the sum is 34.
The spelling of 135130495201 in words is "one hundred thirty-five billion, one hundred thirty million, four hundred ninety-five thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •