Base | Representation |
---|---|
bin | 1000101101111010001… |
… | …1011001000000111000 |
3 | 112022120012221210202220 |
4 | 2023132203121000320 |
5 | 4423203223120022 |
6 | 152444450324040 |
7 | 13551155003265 |
oct | 2133643310070 |
9 | 468505853686 |
10 | 149762707512 |
11 | 58572164860 |
12 | 25037289620 |
13 | 11179368ac2 |
14 | 736a06226c |
15 | 3d67d5a85c |
hex | 22de8d9038 |
149762707512 has 64 divisors (see below), whose sum is σ = 408607580160. Its totient is φ = 45364435200.
The previous prime is 149762707489. The next prime is 149762707517. The reversal of 149762707512 is 215707267941.
It is a super-2 number, since 2×1497627075122 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (149762707517) 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 15 ways as a sum of consecutive naturals, for example, 553033 + ... + 778055.
It is an arithmetic number, because the mean of its divisors is an integer number (6384493440).
Almost surely, 2149762707512 is an apocalyptic number.
149762707512 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
149762707512 is an abundant number, since it is smaller than the sum of its proper divisors (258844872648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
149762707512 is a wasteful number, since it uses less digits than its factorization.
149762707512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 227564 (or 227560 counting only the distinct ones).
The product of its (nonzero) digits is 1481760, while the sum is 51.
The spelling of 149762707512 in words is "one hundred forty-nine billion, seven hundred sixty-two million, seven hundred seven thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •