Base | Representation |
---|---|
bin | 10001110101001… |
… | …01001110101000 |
3 | 101102110011201211 |
4 | 20322211032220 |
5 | 301242341233 |
6 | 22501522504 |
7 | 3464235313 |
oct | 1072451650 |
9 | 342404654 |
10 | 149574568 |
11 | 77481650 |
12 | 42113434 |
13 | 24cb0380 |
14 | 15c1797a |
15 | d1e85cd |
hex | 8ea53a8 |
149574568 has 64 divisors (see below), whose sum is σ = 348909120. Its totient is φ = 59059200.
The previous prime is 149574559. The next prime is 149574577. The reversal of 149574568 is 865475941.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (149574559) and next prime (149574577).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15603 + ... + 23293.
It is an arithmetic number, because the mean of its divisors is an integer number (5451705).
Almost surely, 2149574568 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 149574568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (174454560).
149574568 is an abundant number, since it is smaller than the sum of its proper divisors (199334552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
149574568 is a wasteful number, since it uses less digits than its factorization.
149574568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7738 (or 7734 counting only the distinct ones).
The product of its digits is 1209600, while the sum is 49.
The square root of 149574568 is about 12230.0681927780. The cubic root of 149574568 is about 530.8264878779.
The spelling of 149574568 in words is "one hundred forty-nine million, five hundred seventy-four thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •