Base | Representation |
---|---|
bin | 10001110000000… |
… | …10110010011111 |
3 | 101101012101001010 |
4 | 20320002302133 |
5 | 301110043330 |
6 | 22435350303 |
7 | 3455464440 |
oct | 1070026237 |
9 | 341171033 |
10 | 148909215 |
11 | 77067774 |
12 | 41a52393 |
13 | 24b09580 |
14 | 15ac32c7 |
15 | d1163b0 |
hex | 8e02c9f |
148909215 has 96 divisors (see below), whose sum is σ = 305303040. Its totient is φ = 60334848.
The previous prime is 148909181. The next prime is 148909219. The reversal of 148909215 is 512909841.
It is a de Polignac number, because none of the positive numbers 2k-148909215 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (148909219) by changing a digit.
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 95 ways as a sum of consecutive naturals, for example, 2523856 + ... + 2523914.
It is an arithmetic number, because the mean of its divisors is an integer number (3180240).
Almost surely, 2148909215 is an apocalyptic number.
148909215 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
148909215 is an abundant number, since it is smaller than the sum of its proper divisors (156393825).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
148909215 is a wasteful number, since it uses less digits than its factorization.
148909215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173 (or 130 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 39.
The square root of 148909215 is about 12202.8363506195. The cubic root of 148909215 is about 530.0382255567.
The spelling of 148909215 in words is "one hundred forty-eight million, nine hundred nine thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •