Base | Representation |
---|---|
bin | 10000001101010… |
… | …11000101001000 |
3 | 100110211211201121 |
4 | 20012223011020 |
5 | 234301421143 |
6 | 21254125024 |
7 | 3240462250 |
oct | 1006530510 |
9 | 313754647 |
10 | 135967048 |
11 | 6a828068 |
12 | 39650774 |
13 | 22227799 |
14 | 140b4960 |
15 | be0b7ed |
hex | 81ab148 |
135967048 has 64 divisors (see below), whose sum is σ = 302123520. Its totient is φ = 56160000.
The previous prime is 135967043. The next prime is 135967049. The reversal of 135967048 is 840769531.
It is a plaindrome in base 13.
It is a zygodrome in base 13.
It is a junction number, because it is equal to n+sod(n) for n = 135966995 and 135967013.
It is not an unprimeable number, because it can be changed into a prime (135967043) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 180673 + ... + 181423.
It is an arithmetic number, because the mean of its divisors is an integer number (4720680).
Almost surely, 2135967048 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 135967048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (151061760).
135967048 is an abundant number, since it is smaller than the sum of its proper divisors (166156472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135967048 is a wasteful number, since it uses less digits than its factorization.
135967048 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 878 (or 874 counting only the distinct ones).
The product of its (nonzero) digits is 181440, while the sum is 43.
The square root of 135967048 is about 11660.4908987572. The cubic root of 135967048 is about 514.2147810165.
The spelling of 135967048 in words is "one hundred thirty-five million, nine hundred sixty-seven thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •