Base | Representation |
---|---|
bin | 10001101100111… |
… | …10010011101001 |
3 | 101100102110110122 |
4 | 20312132103221 |
5 | 301003411031 |
6 | 22422453025 |
7 | 3452131505 |
oct | 1066362351 |
9 | 340373418 |
10 | 148497641 |
11 | 76906526 |
12 | 41894175 |
13 | 249c4136 |
14 | 15a17305 |
15 | d08447b |
hex | 8d9e4e9 |
148497641 has 4 divisors (see below), whose sum is σ = 148896132. Its totient is φ = 148099152.
The previous prime is 148497623. The next prime is 148497653. The reversal of 148497641 is 146794841.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 146794841 = 337 ⋅435593.
It can be written as a sum of positive squares in 2 ways, for example, as 114811225 + 33686416 = 10715^2 + 5804^2 .
It is a cyclic number.
It is not a de Polignac number, because 148497641 - 26 = 148497577 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 148497592 and 148497601.
It is not an unprimeable number, because it can be changed into a prime (148497611) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 198686 + ... + 199431.
It is an arithmetic number, because the mean of its divisors is an integer number (37224033).
Almost surely, 2148497641 is an apocalyptic number.
It is an amenable number.
148497641 is a deficient number, since it is larger than the sum of its proper divisors (398491).
148497641 is an equidigital number, since it uses as much as digits as its factorization.
148497641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 398490.
The product of its digits is 193536, while the sum is 44.
The square root of 148497641 is about 12185.9608156271. The cubic root of 148497641 is about 529.5494462128.
The spelling of 148497641 in words is "one hundred forty-eight million, four hundred ninety-seven thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •