Base | Representation |
---|---|
bin | 10001101100001… |
… | …11101001101001 |
3 | 101100020202011121 |
4 | 20312013221221 |
5 | 300442423331 |
6 | 22420455241 |
7 | 3451264114 |
oct | 1066075151 |
9 | 340222147 |
10 | 148404841 |
11 | 76852832 |
12 | 4184a521 |
13 | 24990b20 |
14 | 159d157b |
15 | d066c11 |
hex | 8d87a69 |
148404841 has 8 divisors (see below), whose sum is σ = 160651400. Its totient is φ = 136276992.
The previous prime is 148404833. The next prime is 148404853.
148404841 is nontrivially palindromic in base 10.
148404841 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 23970816 + 124434025 = 4896^2 + 11155^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 148404841 - 23 = 148404833 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 148404797 and 148404806.
It is not an unprimeable number, because it can be changed into a prime (148404241) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27066 + ... + 32083.
It is an arithmetic number, because the mean of its divisors is an integer number (20081425).
Almost surely, 2148404841 is an apocalyptic number.
It is an amenable number.
148404841 is a deficient number, since it is larger than the sum of its proper divisors (12246559).
148404841 is a wasteful number, since it uses less digits than its factorization.
148404841 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 59355.
The product of its (nonzero) digits is 16384, while the sum is 34.
The square root of 148404841 is about 12182.1525602005. The cubic root of 148404841 is about 529.4391135310.
The spelling of 148404841 in words is "one hundred forty-eight million, four hundred four thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •