Base | Representation |
---|---|
bin | 10001110100111… |
… | …00000011001101 |
3 | 101102101021011102 |
4 | 20322130003031 |
5 | 301240140343 |
6 | 22501032445 |
7 | 3464020565 |
oct | 1072340315 |
9 | 342337142 |
10 | 149536973 |
11 | 77456383 |
12 | 420b5725 |
13 | 24c99221 |
14 | 15c07da5 |
15 | d1dc3b8 |
hex | 8e9c0cd |
149536973 has 4 divisors (see below), whose sum is σ = 157407360. Its totient is φ = 141666588.
The previous prime is 149536949. The next prime is 149536993. The reversal of 149536973 is 379635941.
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.
It is a cyclic number.
It is not a de Polignac number, because 149536973 - 220 = 148488397 is a prime.
It is a super-2 number, since 2×1495369732 = 44722612588005458, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (149536993) 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, 3935165 + ... + 3935202.
It is an arithmetic number, because the mean of its divisors is an integer number (39351840).
Almost surely, 2149536973 is an apocalyptic number.
It is an amenable number.
149536973 is a deficient number, since it is larger than the sum of its proper divisors (7870387).
149536973 is an equidigital number, since it uses as much as digits as its factorization.
149536973 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7870386.
The product of its digits is 612360, while the sum is 47.
The square root of 149536973 is about 12228.5311055744. The cubic root of 149536973 is about 530.7820104103.
The spelling of 149536973 in words is "one hundred forty-nine million, five hundred thirty-six thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •