Base | Representation |
---|---|
bin | 111110111101100011… |
… | …0000100000100010000 |
3 | 110220222221220122221221 |
4 | 1331323012010010100 |
5 | 4203402022021024 |
6 | 142040401454424 |
7 | 12524416003264 |
oct | 1757306040420 |
9 | 426887818857 |
10 | 135209173264 |
11 | 52384065100 |
12 | 22255341414 |
13 | c99a17cb89 |
14 | 678925a0a4 |
15 | 37b53373e4 |
hex | 1f7b184110 |
135209173264 has 135 divisors (see below), whose sum is σ = 294898321263. Its totient is φ = 60009945600.
The previous prime is 135209173247. The next prime is 135209173271. The reversal of 135209173264 is 462371902531.
The square root of 135209173264 is 367708.
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 32942250000 + 102266923264 = 181500^2 + 319792^2 .
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 135209173264.
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 986928204 + ... + 986928340.
Almost surely, 2135209173264 is an apocalyptic number.
135209173264 is the 367708-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 135209173264
135209173264 is an abundant number, since it is smaller than the sum of its proper divisors (159689147999).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135209173264 is an equidigital number, since it uses as much as digits as its factorization.
135209173264 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 426 (or 211 counting only the distinct ones).
The product of its (nonzero) digits is 272160, while the sum is 43.
The spelling of 135209173264 in words is "one hundred thirty-five billion, two hundred nine million, one hundred seventy-three thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •