Base | Representation |
---|---|
bin | 111111010110010110… |
… | …0001100001011001100 |
3 | 111000010221121121202120 |
4 | 1332230230030023030 |
5 | 4212103030022112 |
6 | 142255124052540 |
7 | 12554141362404 |
oct | 1765454141314 |
9 | 430127547676 |
10 | 136041251532 |
11 | 5277081589a |
12 | 22447b34150 |
13 | caa0684994 |
14 | 6827975804 |
15 | 38133e8e8c |
hex | 1facb0c2cc |
136041251532 has 48 divisors (see below), whose sum is σ = 323339597280. Its totient is φ = 44510236672.
The previous prime is 136041251471. The next prime is 136041251569. The reversal of 136041251532 is 235152140631.
It is a junction number, because it is equal to n+sod(n) for n = 136041251493 and 136041251502.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 318573 + ... + 611204.
It is an arithmetic number, because the mean of its divisors is an integer number (6736241610).
Almost surely, 2136041251532 is an apocalyptic number.
136041251532 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
136041251532 is an abundant number, since it is smaller than the sum of its proper divisors (187298345748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136041251532 is a wasteful number, since it uses less digits than its factorization.
136041251532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 930010 (or 930008 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 33.
The spelling of 136041251532 in words is "one hundred thirty-six billion, forty-one million, two hundred fifty-one thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •