Base | Representation |
---|---|
bin | 10001101110110… |
… | …01100000100101 |
3 | 101100212210002211 |
4 | 20313121200211 |
5 | 301034141013 |
6 | 22432003421 |
7 | 3454161463 |
oct | 1067314045 |
9 | 340783084 |
10 | 148740133 |
11 | 76a61733 |
12 | 41990571 |
13 | 24a7a619 |
14 | 15a7b833 |
15 | d0d123d |
hex | 8dd9825 |
148740133 has 2 divisors, whose sum is σ = 148740134. Its totient is φ = 148740132.
The previous prime is 148740131. The next prime is 148740167. The reversal of 148740133 is 331047841.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 136469124 + 12271009 = 11682^2 + 3503^2 .
It is a cyclic number.
It is not a de Polignac number, because 148740133 - 21 = 148740131 is a prime.
Together with 148740131, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 148740095 and 148740104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (148740131) 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, 74370066 + 74370067.
It is an arithmetic number, because the mean of its divisors is an integer number (74370067).
Almost surely, 2148740133 is an apocalyptic number.
It is an amenable number.
148740133 is a deficient number, since it is larger than the sum of its proper divisors (1).
148740133 is an equidigital number, since it uses as much as digits as its factorization.
148740133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8064, while the sum is 31.
The square root of 148740133 is about 12195.9064033798. The cubic root of 148740133 is about 529.8375353466.
Adding to 148740133 its reverse (331047841), we get a palindrome (479787974).
The spelling of 148740133 in words is "one hundred forty-eight million, seven hundred forty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •