Base | Representation |
---|---|
bin | 10001110101101… |
… | …10011111001101 |
3 | 101102120202201002 |
4 | 20322312133031 |
5 | 301302122021 |
6 | 22503230045 |
7 | 3464651363 |
oct | 1072663715 |
9 | 342522632 |
10 | 149645261 |
11 | 7751a777 |
12 | 42148325 |
13 | 250065bc |
14 | 15c35633 |
15 | d20e50b |
hex | 8eb67cd |
149645261 has 4 divisors (see below), whose sum is σ = 152098524. Its totient is φ = 147192000.
The previous prime is 149645257. The next prime is 149645263. The reversal of 149645261 is 162546941.
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 6100900 + 143544361 = 2470^2 + 11981^2 .
It is a cyclic number.
It is not a de Polignac number, because 149645261 - 22 = 149645257 is a prime.
It is a super-3 number, since 3×1496452613 (a number of 26 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (149645263) 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 in 3 ways as a sum of consecutive naturals, for example, 1226540 + ... + 1226661.
It is an arithmetic number, because the mean of its divisors is an integer number (38024631).
Almost surely, 2149645261 is an apocalyptic number.
It is an amenable number.
149645261 is a deficient number, since it is larger than the sum of its proper divisors (2453263).
149645261 is an equidigital number, since it uses as much as digits as its factorization.
149645261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2453262.
The product of its digits is 51840, while the sum is 38.
The square root of 149645261 is about 12232.9579824342. The cubic root of 149645261 is about 530.9101023744.
The spelling of 149645261 in words is "one hundred forty-nine million, six hundred forty-five thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •