Base | Representation |
---|---|
bin | 10001101101011… |
… | …01100001011001 |
3 | 101100112121221210 |
4 | 20312231201121 |
5 | 301012404321 |
6 | 22424053333 |
7 | 3452511264 |
oct | 1066554131 |
9 | 340477853 |
10 | 148559961 |
11 | 76949330 |
12 | 41904249 |
13 | 24a16604 |
14 | 15a31cdb |
15 | d097b76 |
hex | 8dad859 |
148559961 has 8 divisors (see below), whose sum is σ = 216087264. Its totient is φ = 90036320.
The previous prime is 148559959. The next prime is 148559981. The reversal of 148559961 is 169955841.
148559961 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 148559961 - 21 = 148559959 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 148559961.
It is not an unprimeable number, because it can be changed into a prime (148559911) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2250876 + ... + 2250941.
It is an arithmetic number, because the mean of its divisors is an integer number (27010908).
Almost surely, 2148559961 is an apocalyptic number.
148559961 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
148559961 is a deficient number, since it is larger than the sum of its proper divisors (67527303).
148559961 is a wasteful number, since it uses less digits than its factorization.
148559961 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4501831.
The product of its digits is 388800, while the sum is 48.
The square root of 148559961 is about 12188.5175882878. The cubic root of 148559961 is about 529.6235145184.
The spelling of 148559961 in words is "one hundred forty-eight million, five hundred fifty-nine thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •