Base | Representation |
---|---|
bin | 10001110100101… |
… | …01011110100000 |
3 | 101102022220020012 |
4 | 20322111132200 |
5 | 301233310143 |
6 | 22500304052 |
7 | 3463546232 |
oct | 1072253640 |
9 | 342286205 |
10 | 149510048 |
11 | 77438126 |
12 | 420a2028 |
13 | 24c89bac |
14 | 15bdc252 |
15 | d1d4418 |
hex | 8e957a0 |
149510048 has 12 divisors (see below), whose sum is σ = 294347970. Its totient is φ = 74755008.
The previous prime is 149510047. The next prime is 149510057. The reversal of 149510048 is 840015941.
It can be written as a sum of positive squares in only one way, i.e., 98644624 + 50865424 = 9932^2 + 7132^2 .
It is a Harshad number since it is a multiple of its sum of digits (32), and also a Moran number because the ratio is a prime number: 4672189 = 149510048 / (1 + 4 + 9 + 5 + 1 + 0 + 0 + 4 + 8).
It is a junction number, because it is equal to n+sod(n) for n = 149509996 and 149510023.
It is not an unprimeable number, because it can be changed into a prime (149510041) 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 as a sum of consecutive naturals, namely, 2336063 + ... + 2336126.
Almost surely, 2149510048 is an apocalyptic number.
It is an amenable number.
149510048 is a deficient number, since it is larger than the sum of its proper divisors (144837922).
149510048 is an equidigital number, since it uses as much as digits as its factorization.
149510048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4672199 (or 4672191 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 32.
The square root of 149510048 is about 12227.4301470096. The cubic root of 149510048 is about 530.7501517041.
Adding to 149510048 its reverse (840015941), we get a palindrome (989525989).
The spelling of 149510048 in words is "one hundred forty-nine million, five hundred ten thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.059 sec. • engine limits •