Base | Representation |
---|---|
bin | 10001101110101… |
… | …10100111111001 |
3 | 101100212011220001 |
4 | 20313112213321 |
5 | 301033301223 |
6 | 22431433001 |
7 | 3454112146 |
oct | 1067264771 |
9 | 340764801 |
10 | 148728313 |
11 | 76a53868 |
12 | 41985761 |
13 | 24a75126 |
14 | 15a773cd |
15 | d0cc9ad |
hex | 8dd69f9 |
148728313 has 2 divisors, whose sum is σ = 148728314. Its totient is φ = 148728312.
The previous prime is 148728311. The next prime is 148728331. The reversal of 148728313 is 313827841.
Together with next prime (148728331) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 83393424 + 65334889 = 9132^2 + 8083^2 .
It is a cyclic number.
It is not a de Polignac number, because 148728313 - 21 = 148728311 is a prime.
It is a super-2 number, since 2×1487283132 = 44240222175651938, which contains 22 as substring.
Together with 148728311, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (148728311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 74364156 + 74364157.
It is an arithmetic number, because the mean of its divisors is an integer number (74364157).
Almost surely, 2148728313 is an apocalyptic number.
It is an amenable number.
148728313 is a deficient number, since it is larger than the sum of its proper divisors (1).
148728313 is an equidigital number, since it uses as much as digits as its factorization.
148728313 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 32256, while the sum is 37.
The square root of 148728313 is about 12195.4218049234. The cubic root of 148728313 is about 529.8235000278.
The spelling of 148728313 in words is "one hundred forty-eight million, seven hundred twenty-eight thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •