Base | Representation |
---|---|
bin | 10001110010011… |
… | …10000110101001 |
3 | 101101210001012200 |
4 | 20321032012221 |
5 | 301144431310 |
6 | 22450130413 |
7 | 3461221020 |
oct | 1071160651 |
9 | 341701180 |
10 | 149217705 |
11 | 7725851a |
12 | 41b80a09 |
13 | 24bb6b00 |
14 | 15b638b7 |
15 | d1779c0 |
hex | 8e4e1a9 |
149217705 has 72 divisors (see below), whose sum is σ = 320194368. Its totient is φ = 62944128.
The previous prime is 149217671. The next prime is 149217727. The reversal of 149217705 is 507712941.
It is a happy number.
It is not a de Polignac number, because 149217705 - 212 = 149213609 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 149217705.
It is an unprimeable number.
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 71 ways as a sum of consecutive naturals, for example, 51834 + ... + 54636.
It is an arithmetic number, because the mean of its divisors is an integer number (4447144).
Almost surely, 2149217705 is an apocalyptic number.
149217705 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
149217705 is an abundant number, since it is smaller than the sum of its proper divisors (170976663).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
149217705 is a wasteful number, since it uses less digits than its factorization.
149217705 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2847 (or 2831 counting only the distinct ones).
The product of its (nonzero) digits is 17640, while the sum is 36.
The square root of 149217705 is about 12215.4699050016. The cubic root of 149217705 is about 530.4039936262.
The spelling of 149217705 in words is "one hundred forty-nine million, two hundred seventeen thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •