Base | Representation |
---|---|
bin | 10001110100100… |
… | …10111010101000 |
3 | 101102022100211202 |
4 | 20322102322220 |
5 | 301232441220 |
6 | 22500143332 |
7 | 3463503530 |
oct | 1072227250 |
9 | 342270752 |
10 | 149499560 |
11 | 77430261 |
12 | 42097b48 |
13 | 24c851a2 |
14 | 15bd84c0 |
15 | d1d1275 |
hex | 8e92ea8 |
149499560 has 32 divisors (see below), whose sum is σ = 384428160. Its totient is φ = 51256896.
The previous prime is 149499551. The next prime is 149499599. The reversal of 149499560 is 65994941.
149499560 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Smith number, since the sum of its digits (47) coincides with the sum of the digits of its prime factors.
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 7 ways as a sum of consecutive naturals, for example, 266684 + ... + 267243.
It is an arithmetic number, because the mean of its divisors is an integer number (12013380).
Almost surely, 2149499560 is an apocalyptic number.
149499560 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
149499560 is an abundant number, since it is smaller than the sum of its proper divisors (234928600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
149499560 is a wasteful number, since it uses less digits than its factorization.
149499560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 533945 (or 533941 counting only the distinct ones).
The product of its (nonzero) digits is 349920, while the sum is 47.
The square root of 149499560 is about 12227.0012676862. The cubic root of 149499560 is about 530.7377408598.
The spelling of 149499560 in words is "one hundred forty-nine million, four hundred ninety-nine thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •