Base | Representation |
---|---|
bin | 10001101001010… |
… | …11011100000101 |
3 | 101022112120001201 |
4 | 20310223130011 |
5 | 300343332031 |
6 | 22404422501 |
7 | 3445132003 |
oct | 1064533405 |
9 | 338476051 |
10 | 148027141 |
11 | 76614a89 |
12 | 416a7a31 |
13 | 2488ac32 |
14 | 15933a73 |
15 | ceded61 |
hex | 8d2b705 |
148027141 has 4 divisors (see below), whose sum is σ = 149553292. Its totient is φ = 146500992.
The previous prime is 148027133. The next prime is 148027153. The reversal of 148027141 is 141720841.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 28037025 + 119990116 = 5295^2 + 10954^2 .
It is a cyclic number.
It is not a de Polignac number, because 148027141 - 23 = 148027133 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (148027441) 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 in 3 ways as a sum of consecutive naturals, for example, 762930 + ... + 763123.
It is an arithmetic number, because the mean of its divisors is an integer number (37388323).
Almost surely, 2148027141 is an apocalyptic number.
It is an amenable number.
148027141 is a deficient number, since it is larger than the sum of its proper divisors (1526151).
148027141 is an equidigital number, since it uses as much as digits as its factorization.
148027141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1526150.
The product of its (nonzero) digits is 1792, while the sum is 28.
The square root of 148027141 is about 12166.6404976888. The cubic root of 148027141 is about 528.9895795918.
Adding to 148027141 its reverse (141720841), we get a palindrome (289747982).
The spelling of 148027141 in words is "one hundred forty-eight million, twenty-seven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •