Base | Representation |
---|---|
bin | 10001101001110… |
… | …01011101010001 |
3 | 101022122110211101 |
4 | 20310321131101 |
5 | 300402201221 |
6 | 22405544401 |
7 | 3445461262 |
oct | 1064713521 |
9 | 338573741 |
10 | 148084561 |
11 | 76654139 |
12 | 41715101 |
13 | 248ab101 |
14 | 1594a969 |
15 | d001d91 |
hex | 8d39751 |
148084561 has 9 divisors (see below), whose sum is σ = 152146089. Its totient is φ = 144129636.
The previous prime is 148084543. The next prime is 148084567. The reversal of 148084561 is 165480841.
The square root of 148084561 is 12169.
It is a perfect power (a square), and thus also a powerful number.
148084561 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 148084561 - 29 = 148084049 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 148084561.
It is not an unprimeable number, because it can be changed into a prime (148084567) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 523126 + ... + 523408.
It is an arithmetic number, because the mean of its divisors is an integer number (16905121).
Almost surely, 2148084561 is an apocalyptic number.
148084561 is the 12169-th square number.
148084561 is the 6085-th centered octagonal number.
It is an amenable number.
148084561 is a deficient number, since it is larger than the sum of its proper divisors (4061528).
148084561 is an frugal number, since it uses more digits than its factorization.
148084561 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 652 (or 326 counting only the distinct ones).
The product of its (nonzero) digits is 30720, while the sum is 37.
The cubic root of 148084561 is about 529.0579694264.
The spelling of 148084561 in words is "one hundred forty-eight million, eighty-four thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •