Base | Representation |
---|---|
bin | 10001101001001… |
… | …10011001000001 |
3 | 101022111111200221 |
4 | 20310212121001 |
5 | 300342201330 |
6 | 22404143041 |
7 | 3445014505 |
oct | 1064463101 |
9 | 338444627 |
10 | 148006465 |
11 | 766004a2 |
12 | 41697a81 |
13 | 248816b9 |
14 | 1592a305 |
15 | ced8b7a |
hex | 8d26641 |
148006465 has 4 divisors (see below), whose sum is σ = 177607764. Its totient is φ = 118405168.
The previous prime is 148006451. The next prime is 148006477. The reversal of 148006465 is 564600841.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 564600841 = 7 ⋅80657263.
It can be written as a sum of positive squares in 2 ways, for example, as 30869136 + 117137329 = 5556^2 + 10823^2 .
It is a cyclic number.
It is not a de Polignac number, because 148006465 - 223 = 139617857 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 148006465.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14800642 + ... + 14800651.
It is an arithmetic number, because the mean of its divisors is an integer number (44401941).
Almost surely, 2148006465 is an apocalyptic number.
It is an amenable number.
148006465 is a deficient number, since it is larger than the sum of its proper divisors (29601299).
148006465 is an equidigital number, since it uses as much as digits as its factorization.
148006465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29601298.
The product of its (nonzero) digits is 23040, while the sum is 34.
The square root of 148006465 is about 12165.7907675580. The cubic root of 148006465 is about 528.9649492037.
The spelling of 148006465 in words is "one hundred forty-eight million, six thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •