Base | Representation |
---|---|
bin | 10001110000000… |
… | …01100001101000 |
3 | 101101012002221110 |
4 | 20320001201220 |
5 | 301104412130 |
6 | 22435310320 |
7 | 3455443365 |
oct | 1070014150 |
9 | 341162843 |
10 | 148904040 |
11 | 7706389a |
12 | 41a4b3a0 |
13 | 24b070cc |
14 | 15ac146c |
15 | d114ab0 |
hex | 8e01868 |
148904040 has 64 divisors (see below), whose sum is σ = 453029760. Its totient is φ = 39146240.
The previous prime is 148904039. The next prime is 148904051. The reversal of 148904040 is 40409841.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 148903989 and 148904007.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 219 + ... + 17258.
It is an arithmetic number, because the mean of its divisors is an integer number (7078590).
Almost surely, 2148904040 is an apocalyptic number.
148904040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 148904040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (226514880).
148904040 is an abundant number, since it is smaller than the sum of its proper divisors (304125720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
148904040 is a wasteful number, since it uses less digits than its factorization.
148904040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17562 (or 17558 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 30.
The square root of 148904040 is about 12202.6243079102. The cubic root of 148904040 is about 530.0320853959.
The spelling of 148904040 in words is "one hundred forty-eight million, nine hundred four thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •