Base | Representation |
---|---|
bin | 10001110100110… |
… | …11001101100001 |
3 | 101102101002110011 |
4 | 20322123031201 |
5 | 301240033122 |
6 | 22501004521 |
7 | 3464004556 |
oct | 1072331541 |
9 | 342332404 |
10 | 149533537 |
11 | 7745383a |
12 | 420b3741 |
13 | 24c977aa |
14 | 15c06a2d |
15 | d1db377 |
hex | 8e9b361 |
149533537 has 2 divisors, whose sum is σ = 149533538. Its totient is φ = 149533536.
The previous prime is 149533529. The next prime is 149533543. The reversal of 149533537 is 735335941.
149533537 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 148449856 + 1083681 = 12184^2 + 1041^2 .
It is an emirp because it is prime and its reverse (735335941) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 149533537 - 23 = 149533529 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 149533537.
It is not a weakly prime, because it can be changed into another prime (149533507) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 74766768 + 74766769.
It is an arithmetic number, because the mean of its divisors is an integer number (74766769).
Almost surely, 2149533537 is an apocalyptic number.
It is an amenable number.
149533537 is a deficient number, since it is larger than the sum of its proper divisors (1).
149533537 is an equidigital number, since it uses as much as digits as its factorization.
149533537 is an evil number, because the sum of its binary digits is even.
The product of its digits is 170100, while the sum is 40.
The square root of 149533537 is about 12228.3906136499. The cubic root of 149533537 is about 530.7779450144. Note that the first 3 decimals are identical.
The spelling of 149533537 in words is "one hundred forty-nine million, five hundred thirty-three thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •