Base | Representation |
---|---|
bin | 10001101101001… |
… | …10110100000000 |
3 | 101100111020020222 |
4 | 20312212310000 |
5 | 301011014410 |
6 | 22423322212 |
7 | 3452335205 |
oct | 1066466400 |
9 | 340436228 |
10 | 148532480 |
11 | 7692a718 |
12 | 418b0368 |
13 | 24a06c55 |
14 | 15a25cac |
15 | d08e955 |
hex | 8da6d00 |
148532480 has 36 divisors (see below), whose sum is σ = 355784772. Its totient is φ = 59412480.
The previous prime is 148532477. The next prime is 148532491. The reversal of 148532480 is 84235841.
It can be written as a sum of positive squares in 2 ways, for example, as 111175936 + 37356544 = 10544^2 + 6112^2 .
It is a super-2 number, since 2×1485324802 = 44123795229900800, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 148532480.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 56741 + ... + 59300.
Almost surely, 2148532480 is an apocalyptic number.
148532480 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
148532480 is an abundant number, since it is smaller than the sum of its proper divisors (207252292).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
148532480 is an equidigital number, since it uses as much as digits as its factorization.
148532480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116062 (or 116048 counting only the distinct ones).
The product of its (nonzero) digits is 30720, while the sum is 35.
The square root of 148532480 is about 12187.3902046336. The cubic root of 148532480 is about 529.5908554690.
The spelling of 148532480 in words is "one hundred forty-eight million, five hundred thirty-two thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •