Base | Representation |
---|---|
bin | 10001101100010… |
… | …00101011011100 |
3 | 101100020221221120 |
4 | 20312020223130 |
5 | 300443042202 |
6 | 22420530540 |
7 | 3451312311 |
oct | 1066105334 |
9 | 340227846 |
10 | 148409052 |
11 | 76855a10 |
12 | 41850a50 |
13 | 24992a0c |
14 | 159d2d08 |
15 | d0680bc |
hex | 8d88adc |
148409052 has 48 divisors (see below), whose sum is σ = 378628992. Its totient is φ = 44870080.
The previous prime is 148409047. The next prime is 148409077. The reversal of 148409052 is 250904841.
148409052 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
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, 73318 + ... + 75314.
It is an arithmetic number, because the mean of its divisors is an integer number (7888104).
Almost surely, 2148409052 is an apocalyptic number.
148409052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
148409052 is an abundant number, since it is smaller than the sum of its proper divisors (230219940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
148409052 is a wasteful number, since it uses less digits than its factorization.
148409052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2578 (or 2576 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 33.
The square root of 148409052 is about 12182.3253937826. The cubic root of 148409052 is about 529.4441211103. Note that the first 3 decimals are identical.
The spelling of 148409052 in words is "one hundred forty-eight million, four hundred nine thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •