Base | Representation |
---|---|
bin | 10001110010101… |
… | …11011111000111 |
3 | 101101211222221000 |
4 | 20321113133013 |
5 | 301202144020 |
6 | 22451024343 |
7 | 3461441040 |
oct | 1071273707 |
9 | 341758830 |
10 | 149256135 |
11 | 77284386 |
12 | 41b9b0b3 |
13 | 24bcb452 |
14 | 15b738c7 |
15 | d184090 |
hex | 8e577c7 |
149256135 has 64 divisors (see below), whose sum is σ = 308505600. Its totient is φ = 67049856.
The previous prime is 149256089. The next prime is 149256179. The reversal of 149256135 is 531652941.
149256135 is a `hidden beast` number, since 1 + 4 + 92 + 561 + 3 + 5 = 666.
It is not a de Polignac number, because 149256135 - 27 = 149256007 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 149256135.
It is a congruent number.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 54417 + ... + 57093.
It is an arithmetic number, because the mean of its divisors is an integer number (4820400).
Almost surely, 2149256135 is an apocalyptic number.
149256135 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
149256135 is an abundant number, since it is smaller than the sum of its proper divisors (159249465).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
149256135 is a wasteful number, since it uses less digits than its factorization.
149256135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2757 (or 2751 counting only the distinct ones).
The product of its digits is 32400, while the sum is 36.
The square root of 149256135 is about 12217.0428091253. The cubic root of 149256135 is about 530.4495236922.
The spelling of 149256135 in words is "one hundred forty-nine million, two hundred fifty-six thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •