Base | Representation |
---|---|
bin | 10001110010100… |
… | …01011000111001 |
3 | 101101210201200001 |
4 | 20321101120321 |
5 | 301200344121 |
6 | 22450313001 |
7 | 3461305162 |
oct | 1071213071 |
9 | 341721601 |
10 | 149231161 |
11 | 77267642 |
12 | 41b88761 |
13 | 24bbcc81 |
14 | 15b68769 |
15 | d17b991 |
hex | 8e51639 |
149231161 has 4 divisors (see below), whose sum is σ = 149255824. Its totient is φ = 149206500.
The previous prime is 149231123. The next prime is 149231183. The reversal of 149231161 is 161132941.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 161132941 = 307 ⋅524863.
It is a cyclic number.
It is not a de Polignac number, because 149231161 - 29 = 149230649 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (149231191) 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, 3646 + ... + 17656.
It is an arithmetic number, because the mean of its divisors is an integer number (37313956).
Almost surely, 2149231161 is an apocalyptic number.
It is an amenable number.
149231161 is a deficient number, since it is larger than the sum of its proper divisors (24663).
149231161 is a wasteful number, since it uses less digits than its factorization.
149231161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24662.
The product of its digits is 1296, while the sum is 28.
The square root of 149231161 is about 12216.0206695961. The cubic root of 149231161 is about 530.4199365547.
The spelling of 149231161 in words is "one hundred forty-nine million, two hundred thirty-one thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •