Base | Representation |
---|---|
bin | 10001101110011… |
… | …00010000111001 |
3 | 101100210000200111 |
4 | 20313030100321 |
5 | 301030422011 |
6 | 22430504321 |
7 | 3453544351 |
oct | 1067142071 |
9 | 340700614 |
10 | 148685881 |
11 | 76a249a3 |
12 | 419650a1 |
13 | 24a5ba16 |
14 | 15a65b61 |
15 | d0c0121 |
hex | 8dcc439 |
148685881 has 2 divisors, whose sum is σ = 148685882. Its totient is φ = 148685880.
The previous prime is 148685879. The next prime is 148685899. The reversal of 148685881 is 188586841.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 141395881 + 7290000 = 11891^2 + 2700^2 .
It is an emirp because it is prime and its reverse (188586841) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 148685881 - 21 = 148685879 is a prime.
It is a super-2 number, since 2×1486858812 = 44214982417492322, which contains 22 as substring.
Together with 148685879, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (148685861) 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, 74342940 + 74342941.
It is an arithmetic number, because the mean of its divisors is an integer number (74342941).
Almost surely, 2148685881 is an apocalyptic number.
It is an amenable number.
148685881 is a deficient number, since it is larger than the sum of its proper divisors (1).
148685881 is an equidigital number, since it uses as much as digits as its factorization.
148685881 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 491520, while the sum is 49.
The square root of 148685881 is about 12193.6820115993. The cubic root of 148685881 is about 529.7731092434.
The spelling of 148685881 in words is "one hundred forty-eight million, six hundred eighty-five thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •