Base | Representation |
---|---|
bin | 1000101110101110010… |
… | …1000011111111110101 |
3 | 112100010110011220001112 |
4 | 2023223211003333311 |
5 | 4424130144441100 |
6 | 152522254404405 |
7 | 13556450405102 |
oct | 2135345037765 |
9 | 470113156045 |
10 | 149981249525 |
11 | 58674561698 |
12 | 25098500705 |
13 | 111b27159c3 |
14 | 738b0adaa9 |
15 | 3d7c128b35 |
hex | 22eb943ff5 |
149981249525 has 54 divisors (see below), whose sum is σ = 203317034310. Its totient is φ = 109605363840.
The previous prime is 149981249501. The next prime is 149981249527. The reversal of 149981249525 is 525942189941.
It can be written as a sum of positive squares in 9 ways, for example, as 23121331249 + 126859918276 = 152057^2 + 356174^2 .
It is not a de Polignac number, because 149981249525 - 28 = 149981249269 is a prime.
Its product of digits (9331200) is a multiple of the sum of its prime divisors (810).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (149981249527) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 53 ways as a sum of consecutive naturals, for example, 198125447 + ... + 198126203.
It is an arithmetic number, because the mean of its divisors is an integer number (3765130265).
Almost surely, 2149981249525 is an apocalyptic number.
It is an amenable number.
149981249525 is a deficient number, since it is larger than the sum of its proper divisors (53335784785).
149981249525 is an frugal number, since it uses more digits than its factorization.
149981249525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1591 (or 810 counting only the distinct ones).
The product of its digits is 9331200, while the sum is 59.
The spelling of 149981249525 in words is "one hundred forty-nine billion, nine hundred eighty-one million, two hundred forty-nine thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.149 sec. • engine limits •