Base | Representation |
---|---|
bin | 100001110010100100010001… |
… | …111111111011111001111011 |
3 | 201111012000120211221111011212 |
4 | 201302210101333323321323 |
5 | 123434313213114211021 |
6 | 1244022412202513335 |
7 | 43205515604321213 |
oct | 4162442177737173 |
9 | 644160524844155 |
10 | 148610465382011 |
11 | 43396387494416 |
12 | 1480185420584b |
13 | 64bcba31a3699 |
14 | 289aadbab7243 |
15 | 122aa74e5885b |
hex | 872911ffbe7b |
148610465382011 has 2 divisors, whose sum is σ = 148610465382012. Its totient is φ = 148610465382010.
The previous prime is 148610465381951. The next prime is 148610465382013. The reversal of 148610465382011 is 110283564016841.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-148610465382011 is a prime.
Together with 148610465382013, 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 (148610465382013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 74305232691005 + 74305232691006.
It is an arithmetic number, because the mean of its divisors is an integer number (74305232691006).
Almost surely, 2148610465382011 is an apocalyptic number.
148610465382011 is a deficient number, since it is larger than the sum of its proper divisors (1).
148610465382011 is an equidigital number, since it uses as much as digits as its factorization.
148610465382011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1105920, while the sum is 50.
The spelling of 148610465382011 in words is "one hundred forty-eight trillion, six hundred ten billion, four hundred sixty-five million, three hundred eighty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •