Base | Representation |
---|---|
bin | 10001101110100… |
… | …01101000000001 |
3 | 101100211010210211 |
4 | 20313101220001 |
5 | 301032122331 |
6 | 22431154121 |
7 | 3453665362 |
oct | 1067215001 |
9 | 340733724 |
10 | 148707841 |
11 | 76a3a447 |
12 | 41975941 |
13 | 24a68a09 |
14 | 15a6db69 |
15 | d0c68b1 |
hex | 8dd1a01 |
148707841 has 2 divisors, whose sum is σ = 148707842. Its totient is φ = 148707840.
The previous prime is 148707833. The next prime is 148707869.
148707841 is nontrivially palindromic in base 10.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 147258225 + 1449616 = 12135^2 + 1204^2 .
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 148707841 - 23 = 148707833 is a prime.
It is a super-2 number, since 2×1487078412 = 44228043949762562, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 148707794 and 148707803.
It is not a weakly prime, because it can be changed into another prime (148707821) by changing a digit.
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 as a sum of consecutive naturals, namely, 74353920 + 74353921.
It is an arithmetic number, because the mean of its divisors is an integer number (74353921).
Almost surely, 2148707841 is an apocalyptic number.
It is an amenable number.
148707841 is a deficient number, since it is larger than the sum of its proper divisors (1).
148707841 is an equidigital number, since it uses as much as digits as its factorization.
148707841 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 50176, while the sum is 40.
The square root of 148707841 is about 12194.5824446760. The cubic root of 148707841 is about 529.7991893812.
The spelling of 148707841 in words is "one hundred forty-eight million, seven hundred seven thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •