Base | Representation |
---|---|
bin | 10000010000111… |
… | …11111010000000 |
3 | 100111202011010120 |
4 | 20020133322000 |
5 | 234412224233 |
6 | 21312300240 |
7 | 3244524330 |
oct | 1010377200 |
9 | 314664116 |
10 | 136445568 |
11 | 70024636 |
12 | 39841680 |
13 | 2236452c |
14 | 1419b0c0 |
15 | bea34b3 |
hex | 821fe80 |
136445568 has 128 divisors (see below), whose sum is σ = 432414720. Its totient is φ = 37272576.
The previous prime is 136445557. The next prime is 136445627. The reversal of 136445568 is 865544631.
It is a tau number, because it is divible by the number of its divisors (128).
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 60721 + ... + 62927.
It is an arithmetic number, because the mean of its divisors is an integer number (3378240).
Almost surely, 2136445568 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 136445568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (216207360).
136445568 is an abundant number, since it is smaller than the sum of its proper divisors (295969152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136445568 is a wasteful number, since it uses less digits than its factorization.
136445568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2254 (or 2242 counting only the distinct ones).
The product of its digits is 345600, while the sum is 42.
The square root of 136445568 is about 11680.9917387181. The cubic root of 136445568 is about 514.8173141585.
The spelling of 136445568 in words is "one hundred thirty-six million, four hundred forty-five thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •